문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.