All challenges
Easy 0 solved 0% acceptance

Abundant, Perfect or Deficient

Classify a number as abundant, perfect or deficient by the sum of its proper divisors.

What you'll learn

  • Sum proper divisors in O(√n) time
  • Avoid counting a square root divisor twice
  • Return one of three labels from a comparison

Problem

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.

Constraints

1 ≤ n ≤ 10^12

Examples

Example 1
Input:
n = 28

Expected output:
expected = "perfect"
Input:
long long n = 28;

Expected output:
std::string expected = "perfect";
Input:
long n = 28;

Expected output:
string expected = "perfect";

Explanation

The proper divisors 1 + 2 + 4 + 7 + 14 add up to 28, so the answer is "perfect".

Example 2
Input:
n = 15

Expected output:
expected = "deficient"
Input:
long long n = 15;

Expected output:
std::string expected = "deficient";
Input:
long n = 15;

Expected output:
string expected = "deficient";

Explanation

The proper divisors 1 + 3 + 5 add up to 9, which is less than 15, so the answer is "deficient".

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

If d divides n, so does n / d; loop d only while d × d ≤ n.

Hint 2

When d × d = n, add d once, not twice.

Hint 3

Remember to leave n itself out of the sum, and handle n = 1 separately.

Expected complexity

O(√n) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.