Armstrong Number

Asked in:
TCS

Problem Description

Given an integer A, check if it is an Armstrong number of not.
An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.

Problem Constraints

1 <= A <= 10⁹

Input Format

Given an integer A.

Output Format

Return an integer.

Example Input

Input 1:

A = 371

Input 2:

A = 123

Example Output

Output 1:

Output 2:

Example Explanation

Explanation 1:

3×3×3 + 7×7×7 + 1×1×1 = 371

Explanation 2:

1×1×1 + 2×2×2 + 3×3×3 != 123

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.