import java.util.Scanner;
public class Main {
public static int gerLCM(int a,int b){
Scanner in = new Scanner(System.in);
a=in.nextInt();
b=in.nextInt();
int c=1;
for(int i=2;i<=a*b;i++){
if(i%a==0&&i%b==0){
c=i;
break;
}
}
if(a==1||b==1)c=a*b;
return c;
}
}
获取两个整数的最小公倍数
最新推荐文章于 2024-10-07 11:22:30 发布