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.util.Scanner;

public class Main {
	static long a,b;
	static Scanner cin = new Scanner(System.in);
	public static void main(String[] args) {
		while(read()){
			System.out.println(gcd(a,b)+" "+lcm(a,b));
		}
	}

	private static boolean read() {
		if(!cin.hasNext())
        	return false;
        a = cin.nextLong();
        b = cin.nextLong();
		return true;
	}

	private static long gcd(long a, long b) {
		if(b == 0)
			return a;
		else
			return gcd(b,a%b);
	}

	private static long lcm(long a, long b) {
		return a*b/gcd(a,b);
	}
}