方法思想:若有两个数a,b;a%b不等于0,即b不是a的质因数。
a%b得余数c,
若c=0,则b即为两数的最大公约数
若c≠0,则a=b,b=c,再回去执行循环直到a%b=0
import java.util.Scanner;
public class Cdiv{
public static int commonDiv(int a,int b){
int c=0;
while(a % b != 0 ){
c = a % b;
a = b;
b = c;
}
return c;
}
public static void main(String[] args){
System.out.println("请输入两个数字:");
Scanner scan = new Scanner(System.in);
int c = scan.nextInt();
int d = scan.nextInt();
int ret = commonDiv(c,d);
System.out.println(ret);
}
}