/*
输入两个整数M,N求出他们的最小公倍数和最大公约数
最大公约数:求出mn的较小的min
当min同时被m,n整除的时候,break;
最小公倍数同理;
*/
import java.util.Scanner;
class GongYueShu{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
System.out.println("请输出两个正整数M,N");
int m = scan.nextInt();
int n = scan.nextInt();
int min = (m<n)? m:n;
for (int i = min;i>=1;i--){
if(n % i==0 && m % i==0){
System.out.println(m + "和" + n + "的最大公因数是" + i);
break;
}
}
}
}
class GongBeiShu{
public static void main(String[] args){
Scanner scan = new Scanner(System.in);
System.out.println("请输出两个正整数M,N");
int m = scan.nextInt();
int n = scan.nextInt();
int max = (m>n)? m:n;
for (int i = max;i <= m * n;i++){
if(i % n==0 && i % m==0){
System.out.println(m + "和" + n + "的最小公倍数是" + i);
break;
}
}
}
}
运行结果: