[JAVA #19] 최대공약수_유클리드 호제법

자바 (java) 최대 공약수 (Greatest common divisor) 유클리드 호제법 (Euclidean method)

 

import java.util.Scanner;
 
// Greatest common divisor of two integers x, y by Euclidean method
public class CommonDivisor {
 
    public static void main(String[] args) {        
        Scanner input = new Scanner(System.in);
        System.out.println("Input 2 numbers");
        System.out.print(">>>  ");
        int x = input.nextInt();
        System.out.print(">>>  ");
        int y = input.nextInt();
        int orgX = x, orgY = y;
 
        if (x < y) {
            int temp = x;
            x = y;
            y = temp;
        }
 
        while (true) {
            int m = x%y;
            if (m == 0) break;
            x = y;
            y = m;
        }
 
        System.out.println("Greatest common divisor of two integers "
                            + orgX + ", " + orgY
                            + " by Euclidean method: " + y);
    }
 
}