The least common multiple and greatest common divisor

---

import java.util.Scanner;

public class Test {

	public static void main(String[] args) {
		
		Scanner in=new Scanner(System.in);
		int a=in.nextInt();
		int b=in.nextInt();
		int c=a*b;
		int middle1,middle2,middle3;
		middle1=a;
		middle2=b;
		middle3=0;
		
		// 最小公倍数
		if(a<b){
			int r=0;
			r=a;
			a=b;
			b=r;
		}
		while(true){
			int r=a%b;
			if(r==0){
				System.out.println("最小公倍数："+c/b);
				break;
			}else{
				a=b;
				b=r;
			}
		}
		
		// 最大公约数
		for (int i=0;i<i+1;i++) {
			middle3=middle1%middle2;
			if(middle3==0)
				break;
			else{
				middle1=middle2;
				middle2=middle3;
			}
		}
		
		System.out.println("最大公约数为："+middle2);
		
		// 最大的lcm(a,b)-gcd(a,b)
		System.out.println("最大的lcm(a,b)-gcd(a,b)为："+((c/b)-middle2));
		
	}

}