Problem:
GCD and LCM

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Input

Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.

Constraints

0 < a, b ≤ 2,000,000,000

LCM(a, b) ≤ 2,000,000,000

The number of data sets ≤ 50

Output

For each data set, print GCD and LCM separated by a single space in a line.

Sample Input

8 6
50000000 30000000

Output for the Sample Input

2 24
10000000 150000000

Solution in JAVA (judge verdict: Accepted)



import java.io.IOException;
import java.util.Scanner;


public class Main{

	public static void main(String[] args) throws IOException {
		Scanner scan = new Scanner(System.in);
		while (scan.hasNext()) {
			long a = scan.nextLong();
			long b = scan.nextLong();
			long gcd = divide(a, b);

			long lcm = a * b / gcd;
			System.out.println(gcd + " " + lcm);

		}
	}

	public static long divide(long a, long b) {
		long r;
		if (a < b) {
			long temp = b;
			b = a;
			a = temp;
		}
		r = a % b;

		return r == 0 ? b : divide(b, r);
	}

}