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

public class Main {

	public static void main(String[] args) throws IOException {
		new Main().run();
	}
	
	private void run() throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String str;
		while ((str = reader.readLine()) != null) {
			StringTokenizer st = new StringTokenizer(str);
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			System.out.println(String.format("%d %d", getGCD(a,b), getLCM(a,b)));
		}
		reader.close();
	}

	private int getGCD(int a, int b) {
		int ans = 1;
		for (int i = 1; i <= a; i++) {
			if (a % i == 0) {
				if (b % (a / i) == 0) {
					ans = a / i;
					break;
				}
			}
		}
		return ans;
	}
	
	private int getLCM(int a, int b) {
		int ans = 0;
		int m = 1;
		while (true) {
			if (b * m % a == 0) {
				ans = b * m;
				break;
			}
			m++;
		}
		return ans;
	}
}