Question

Write a class to check whether a given number is Armstrong or not using a function name int isArmstrong(int number). Function should return a value 1 if number is Armstrong otherwise it return 0 if not. An Armstrong number is a number which equals to the sum of the cubes of its individual digits. For example, 153 is an Armstrong number as − 153 = (1)3 + (5)3 + (3)3 153 1 + 125 + 27 154 153.​

Answer 1

Given a number x, determine whether the given number is Armstrong number or not. A positive integer of n digits is called an Armstrong number of order n (order is number of digits) if.

abcd... = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + ....

Example:

Input : 153

Output : Yes

153 is an Armstrong number.

1*1*1 + 5*5*5 + 3*3*3 = 153

Input : 120

Output : No

120 is not a Armstrong number.

1*1*1 + 2*2*2 + 0*0*0 = 9

Input : 1253

Output : No

1253 is not a Armstrong Number

1*1*1*1 + 2*2*2*2 + 5*5*5*5 + 3*3*3*3 = 723

Input : 1634

Output : Yes

1*1*1*1 + 6*6*6*6 + 3*3*3*3 + 4*4*4*4 = 1634