Условие
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.
Ограничения
1 ≤ n ≤ 10^12
Примеры
Ввод:
n = 28
Ожидаемый вывод:
expected = "perfect"
Ввод:
long long n = 28;
Ожидаемый вывод:
std::string expected = "perfect";
Ввод:
long n = 28;
Ожидаемый вывод:
string expected = "perfect";
Пояснение
The proper divisors 1 + 2 + 4 + 7 + 14 add up to 28, so the answer is "perfect".
Ввод:
n = 15
Ожидаемый вывод:
expected = "deficient"
Ввод:
long long n = 15;
Ожидаемый вывод:
std::string expected = "deficient";
Ввод:
long n = 15;
Ожидаемый вывод:
string expected = "deficient";
Пояснение
The proper divisors 1 + 3 + 5 add up to 9, which is less than 15, so the answer is "deficient".
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
If d divides n, so does n / d; loop d only while d × d ≤ n.
Подсказка 2
When d × d = n, add d once, not twice.
Подсказка 3
Remember to leave n itself out of the sum, and handle n = 1 separately.
Ожидаемая сложность
O(√n) time, O(1) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.