Problème
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.
Contraintes
1 ≤ n ≤ 10^12
Exemples
Entrée :
n = 28
Sortie attendue :
expected = "perfect"
Entrée :
long long n = 28;
Sortie attendue :
std::string expected = "perfect";
Entrée :
long n = 28;
Sortie attendue :
string expected = "perfect";
Explication
The proper divisors 1 + 2 + 4 + 7 + 14 add up to 28, so the answer is "perfect".
Entrée :
n = 15
Sortie attendue :
expected = "deficient"
Entrée :
long long n = 15;
Sortie attendue :
std::string expected = "deficient";
Entrée :
long n = 15;
Sortie attendue :
string expected = "deficient";
Explication
The proper divisors 1 + 3 + 5 add up to 9, which is less than 15, so the answer is "deficient".
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
If d divides n, so does n / d; loop d only while d × d ≤ n.
Indice 2
When d × d = n, add d once, not twice.
Indice 3
Remember to leave n itself out of the sum, and handle n = 1 separately.
Complexité attendue
O(√n) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.