辗转求余法:
import java.util.Scanner;
public class 求最大公因数和最小公倍数{
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
while(scan.hasNext()){
int a=scan.nextInt();
int b=scan.nextInt();
int tmp=0,num=0;
num=a*b;
while(b!=0){
tmp=a%b; //余数
a=b;
b=tmp;
}
System.out.println(a + " " + num/a); //a即最大公约数,a*b的乘积除a的商即为最小公倍数
}
}
}