Easy 0 solved 0% acceptance

Disarium Number

Check whether a number equals the sum of its digits raised to their positions.

What you'll learn

  • Read digits from left to right
  • Raise a digit to its position with integer arithmetic
  • Add powers without overflow

Problem

Number the digits of n from the left starting at 1, raise each digit to the power of its position, and add the results. If the total is n itself, the number is a disarium number. For example, 175 gives 1¹ + 7² + 5³ = 1 + 49 + 125 = 175.

Implement disarium_number(n).

Input

n: The number to test.

Output

Return true if n is a disarium number, otherwise false. Every single-digit number is a disarium number.

Constraints

1 ≤ n ≤ 10^9

Examples

Example 1
Input:
n = 89

Expected output:
expected = True
Input:
long long n = 89;

Expected output:
bool expected = true;
Input:
long n = 89;

Expected output:
bool expected = true;

Explanation

8¹ + 9² = 8 + 81 = 89, so the answer is true.

Example 2
Input:
n = 98

Expected output:
expected = False
Input:
long long n = 98;

Expected output:
bool expected = false;
Input:
long n = 98;

Expected output:
bool expected = false;

Explanation

9¹ + 8² = 9 + 64 = 73, not 98, so the answer is false.

How to approach it

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

Hint 1

Positions count from the left, so either turn n into a string or count the digits first.

Hint 2

Use integer multiplication for powers instead of a floating point function.

Hint 3

The largest term is 9^10, which fits easily in 64 bits.

Expected complexity

O(d^2) time for d digits, 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.