辗转相除法,又称欧几里得算法,具体操作为找到二者中较大的数记为max,较小的记为min。计算二者的余数,再用min对余数取余,当余数为0时的min就是最大公约数
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int max = Math.max(a,b);
int min = Math.min(a,b);
int r = max % min;
while (r != 0){
max = min;
min = r;
r = max % min;
}
System.out.println(min);
}