题解 | 最大公因数与最小公倍数

这题可以直接使用Java中的BigInteger无脑去做，因为里面自带了gcd，而要求lcm只需要把a*b/gcd即可

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		int a=scanner.nextInt();
		int b=scanner.nextInt();
		BigInteger aBigInteger=new BigInteger(""+a);
		BigInteger bBigInteger=new BigInteger(""+b);
		BigInteger cBigInteger=aBigInteger.gcd(bBigInteger);
		System.out.print(cBigInteger+" ");
		BigInteger dBigInteger=aBigInteger.multiply(bBigInteger).divide(cBigInteger);
		System.out.println(dBigInteger);

	}

}