package Euclid;
import java.util.Scanner;
public class Test_Euclid {
//主程序入口
public static void main(String args[]){
Scanner sc1 = new Scanner(System.in);
int num1 = sc1.nextInt();
int num2 = sc1.nextInt();
gcd test = new gcd();
int aim = test.Euclid(num1,num2);
System.out.println(aim);
}
}
//欧几里得算法
class gcd{
int Euclid(int num1,int num2){
while (num2 != 0){
int r = num1 % num2;
num1 = num2;
num2 = r;
}
return num1;
}
}
利用欧几里得算法求得最大公约数
最新推荐文章于 2022-08-18 18:58:52 发布