Armstrong Number Problem Statement

You are provided an integer 'NUM'. Determine if 'NUM' is an Armstrong number.

Explanation:

An integer 'NUM' with 'k' digits is an Armstrong number if the sum of its digits, each raised to the power of 'k', equals the number itself.

Input:

T, followed by T values of NUM

Output:

For each NUM, output 'YES' if it's an Armstrong number, 'NO' otherwise.

Example:

Input: 2 153 123 Output: YES NO Explanation: '153' is an Armstrong number, whereas '123' is not.

Constraints:

1

Question

Armstrong Number Problem Statement

You are provided an integer 'NUM'. Determine if 'NUM' is an Armstrong number.

Explanation:

An integer 'NUM' with 'k' digits is an Armstrong number if the sum of its digits, each raised to the power of 'k', equals the number itself.

Input:

T, followed by T values of NUM

Output:

For each NUM, output 'YES' if it's an Armstrong number, 'NO' otherwise.

Example:

Input:
2
153
123
Output:
YES
NO
Explanation: '153' is an Armstrong number, whereas '123' is not.

Constraints:

1 <= T <= 100
1 <= NUM <= 10^9
Time Limit: 1 sec

Note:

Just implement the function as described; printing is handled for you.

Accepted Answer

Determine if a given integer is an Armstrong number by checking if the sum of its digits raised to the power of the number of digits equals the number itself.

Iterate through each digit of the number and calculate the sum of each digit raised to the power of the total number of digits.
Compare the calculated sum with the original number to determine if it's an Armstrong number.
Return 'YES' if the number is an Armstrong number, 'NO' otherwise.