Gcd.java

import java.util.*;
 
 
class Gcd {
        
    public static int maximum(int num1, int num2){
        if (num1 > num2) {
            return num1;
        }
        else{
            return num2;
        } 
    }
    public static void gdc(int num1, int num2, int max){
        int gcd = 0 ;
        for(int i = 1; i <= max; i++){
            if(num1 % i == 0 && num2 % i == 0){
                gcd = i;
            }
            
        }
        System.out.println("The greatest common divisor of "+num1 +"and "+num2+ " is "+ gcd);
    }
    public static void main(String[] args) {
       Scanner num = new Scanner(System.in) ;
       int n1 = num.nextInt();
       int n2 = num.nextInt();
       int max = maximum(n1, n2);
       gdc(n1, n2, max);
    }
}