(5375 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".

53 UpvotesUpvote |
9 DownvotesDownvote |

- Face Detection with OpenCV in Java [865 Views]
- Content placeholder animation like Facebook Tutorial using Kotlin [216 Views]
- Java Serialization with Externalizable and their difference [166 Views]
- Red-Black Tree [328 Views]
- Difference between Java Spring and Java Swing [204 Views]

- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [6566 Views]
- Pseudocode and Algorithm to find whether number is Armstrong Number or Not [5375 Views]
- How To Win Ludo King Game Every Time [5135 Views]
- error: Multiple commands produce error in Xcode 10 [4104 Views]
- Create Dynamic Pagination using Java Spring Boot, Hibernate and MySQL [3317 Views]