-----------------------------------------------------------
Scanner con=new Scanner(System.in);
System.out.println("输入两个正整数m和n");
int m=con.nextInt();
int n=con.nextInt();
int d;
if(m<n){
d=m;
m=n;
n=d;
}
for(int j=m;j<=m*n;j++){
if(j%m==0&&j%n==0) {
System.out.println(m+"和"+n+"最小公倍数是"+j);break;
}
}
int mod=1;
for (int i=0;mod!=0;i++){
mod=m%n;
m=n;
n=mod;}
System.out.println(m+"和"+n+"最大公约数是"+m);
------------
Scanner con=new Scanner(System.in);
System.out.println("输入两个正整数m和n");
int a=con.nextInt();
int b=con.nextInt();
int d=1,m,t;
m=a*b;
if(a<b){
t=a;
a=b;
b=t;
}
while(d!=0){
d=a%b;
a=b;
b=d;
}
m=m/a;
System.out.println("最小公倍数是"+m);
System.out.println("最大公因数"+a);