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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException{

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		while(true){
			String str =  br.readLine();
			if(str == null || str == ""){
				break;
			}
			String[] str1Ary = str.split(" ");
			long a = Integer.parseInt(str1Ary[0]);
			long b = Integer.parseInt(str1Ary[1]);
			System.out.println(getGCD(a, b) + " " + getLCM(a, b));
		}
	}

	private static long getGCD(long a, long b){
		long r;
		while ((r = a % b) != 0) {
			a = b;
			b = r;
		}
		return b;
	}

	private static long getLCM(long a, long b) {
		return a * b / getGCD(a, b);
	}
}