Write a Java program to find HCF (GCD) of two numbers

Find HCF (GCD) of two numbers

Sample Output

Find HCF (GCD) of two numbers.

Enter first number: 30
Enter second number: 12
GCD: 6

Java-Source Code

//package loopinjava;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        int dividend, divisor, remainder = 1;

        Scanner input = new Scanner(System.in);

        System.out.println("Find HCF (GCD) of two numbers.\n");

        System.out.print("Enter first number: ");
        dividend = input.nextInt();

        System.out.print("Enter second number: ");
        divisor = input.nextInt();

        while (remainder != 0) {
            remainder = dividend % divisor;
            dividend = divisor;
            divisor = remainder;
        }
        System.out.print("GCD: " + dividend + "\n");
    }
}

Sample Output

Find HCF (GCD) of two numbers.

Enter first number: 153
Enter second number: 81
GCD: 9