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: Wrong Answer)

import java.util.Scanner;

public class Main {
	/**
	 * ???????????\????????£?????´??° a, b ?????\???????????¨??????a ??¨ b ????????§??¬?´???°??¨????°???¬?????°???????????????????????????????????°????????????????????????????????? ????????????a ??¨
	 * b ???????°???¬?????°??? 20 ???????¶??????????????????¨????????????
	 * 
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????

		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.print(greatestcommondivisor(a, b) + " " );
			System.out.println(leastcommonmultiple(a, b));
		}

	}

	/**
	 * ?????§??¬?´???°????????¨??????????????????
	 * 
	 * @param a
	 * @param b
	 */
	public static int greatestcommondivisor(int a, int b) {
		for (int i = b; 1 <= b; i--) {
			if (a % i == 0 && b % i == 0) {
				return i;
				// System.out.println(i);
			}
		}
		return b;
	}

	/**
	 * ????°???¬?????°????????¨??????????????????
	 * 
	 * @param a
	 * @param b
	 */
	public static int leastcommonmultiple(int a, int b) {
		// ?????° A , B ????????§??¬?´???°??? G ????°???¬?????°??? L ??¨????????¨
		// AB=GL???????????????????????????????????§???????????????
		int c = greatestcommondivisor(a, b);
		int d = a * b / c;
		return d;

	}

}