Armstrong Number In Java

				
					import java.util.Scanner;

public class ArmstrongNumber {

    // Function to check if a number is an Armstrong number
    public static boolean isArmstrong(int num) {
        int originalNum = num;  // Store the original number
        int sum = 0;
        int n = 0;
        
        // Step 1: Count the number of digits in the number
        while (num != 0) {
            num /= 10;
            n++;
        }
        
        num = originalNum; // Reset num to its original value
        
        // Step 2: Calculate the sum of digits raised to the power of n
        while (num != 0) {
            int digit = num % 10;  // Extract the last digit
            sum += Math.pow(digit, n);  // Raise it to the power of n and add to sum
            num /= 10;  // Remove the last digit
        }
        
        // Step 3: Check if sum is equal to the original number
        return sum == originalNum;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        
        // Step 4: Ask the user to input a number
        System.out.print("Enter a number: ");
        int number = scanner.nextInt();
        
        // Step 5: Check if the number is an Armstrong number
        if (isArmstrong(number)) {
            System.out.println(number + " is an Armstrong number.");
        } else {
            System.out.println(number + " is not an Armstrong number.");
        }
        
        scanner.close();
    }
}