1
+ import java .util .Scanner ;
2
+
3
+ // Create a program to check if a number is an Armstrong number.🚀
4
+ public class challenge24 {
5
+ public static void main (String [] args ) {
6
+ Scanner scanner = new Scanner (System .in );
7
+ System .out .println ("Enter a number: " );
8
+ int number = scanner .nextInt ();
9
+ if (isArmstrongNumber (number )) {
10
+ System .out .println (number + " is an Armstrong number." );
11
+ } else {
12
+ System .out .println (number + " is not an Armstrong number." );
13
+ }
14
+ }
15
+
16
+ public static boolean isArmstrongNumber (int number ) {
17
+ int originalNumber , remainder , result = 0 , n = 0 ;
18
+ originalNumber = number ;
19
+
20
+ // find the number of digits in the number
21
+ while (originalNumber != 0 ) {
22
+ originalNumber /= 10 ;
23
+ ++n ;
24
+ }
25
+
26
+ originalNumber = number ;
27
+
28
+ // find the sum of the cubes of each digit
29
+ while (originalNumber != 0 ) {
30
+ remainder = originalNumber % 10 ;
31
+ result += Math .pow (remainder , n );
32
+ originalNumber /= 10 ;
33
+ }
34
+
35
+ // if the sum is equal to the original number, then the number is an Armstrong number
36
+ return result == number ;
37
+ }
38
+ }
0 commit comments