Problema
The proper divisors of n are its positive divisors other than n itself. Compare their sum with n: if the sum is larger the number is abundant, if it is equal the number is perfect, and if it is smaller the number is deficient. For example, the proper divisors of 12 are 1, 2, 3, 4 and 6, which add up to 16, so 12 is abundant.
Implement abundant_perfect_deficient(n).
n can be as large as 10^12, so checking every number below n is far too slow. Divisors come in pairs d and n / d, so you only need to try d up to √n.
Input
n: The number to classify.
Output
Return the string "abundant", "perfect" or "deficient" in lowercase. 1 has no proper divisors (sum 0), so it is deficient.
Restrições
1 ≤ n ≤ 10^12
Exemplos
Entrada:
n = 28
Saída esperada:
expected = "perfect"
Entrada:
long long n = 28;
Saída esperada:
std::string expected = "perfect";
Entrada:
long n = 28;
Saída esperada:
string expected = "perfect";
Explicação
The proper divisors 1 + 2 + 4 + 7 + 14 add up to 28, so the answer is "perfect".
Entrada:
n = 15
Saída esperada:
expected = "deficient"
Entrada:
long long n = 15;
Saída esperada:
std::string expected = "deficient";
Entrada:
long n = 15;
Saída esperada:
string expected = "deficient";
Explicação
The proper divisors 1 + 3 + 5 add up to 9, which is less than 15, so the answer is "deficient".
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
If d divides n, so does n / d; loop d only while d × d ≤ n.
Dica 2
When d × d = n, add d once, not twice.
Dica 3
Remember to leave n itself out of the sum, and handle n = 1 separately.
Complexidade esperada
O(√n) time, O(1) extra space
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.