問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。