OJ 求最大公约数和最小公倍数

#

## 标题辗转相除法
求最大公因数

***最小公倍数
需要先求最大公约数，然后将两个输入的数除以最大公约数
int GCD;//最大公约数 great common divisor
int LOM;//最小公倍数 great common multiple

LOM = a*b*GCD;***

`import java.util.Scanner;

public class Main {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	Scanner scan = new Scanner(System.in);
	
	while(scan.hasNext()) {
	int GCD;//最大公约数 great common divisor
	int LOM;//最小公倍数 great common multiple
	int A_temp;
	int B_temp;
	int temper;
	int a =	scan.nextInt();
	int b = scan.nextInt();
	if(a>0&&b>0) {
		A_temp = a;
		B_temp = b;
		if(A_temp<B_temp){
			int temp = A_temp;
			A_temp = B_temp;
			B_temp = temp;
		}//始终将最大的值置为a
		while(true) {
			temper =A_temp % B_temp;
			 if(temper==0) {
				 GCD = B_temp;
				 break;
			 }
			 A_temp =B_temp;
			 B_temp =temper;
		}
		
		System.out.print(GCD);
		System.out.print(" ");
		a = a/GCD;
		b = b/GCD;
		LOM = a*b*GCD;
		System.out.println(LOM);	
	}
 
	}
	
	
}

}
`