(23348 Views)

An Integer number in which the sum of the cubes of its digits is equal to the number itself is called Armstrong Number. For example, 153 is an Armstrong number since 1**3 + 5**3 + 3**3 = 153.

We first take input from user and store it in variable n. Then we initialize 2 variables temp to n and sum to 0. We calculate the cube of last digit by this expression [(n%10)*(n%10)*(n%10)] and add it to value of sum and also divide n by 10. We repeat the above step until n is greater than or equal to 0. At last, we check whether sum is equal to temp, if yes Print "Number is Armstrong Number" else print "Number is Not Armstrong Number".

69 UpvotesUpvote |
12 DownvotesDownvote |

- [Solved] Can MIN() and MAX() functions be used with Date columns in Oracle SQL [812 Views]
- Check if A Number is a Composite number or Not in C++ [566 Views]
- Download AngularJS Up & Running by Shyam Seshadri & Brad Green PDF [2332 Views]
- Can a where Clause be used along with a Truncate command [950 Views]
- Redirect port 80 to some another port using iptables on CentOS [764 Views]

- How To Win Ludo King Game Every Time [25314 Views]
- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [23802 Views]
- Algorithm to find whether number is Armstrong Number or Not [23348 Views]
- Jio Phone hang on LOGO problem Solution - Hard Reset Jio Phone [16522 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [12702 Views]