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: Time Limit Exceeded)

import java.util.Arrays;
import java.util.Scanner;

public class Main
{
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
				long[] num = new long[2];
			while(sc.hasNext())
			{
				num[0] = sc.nextLong();
				num[1] = sc.nextLong();
				Arrays.sort(num);
					for(long i = num[1];;i--)
					{
						if(num[0]%i == 0 && num[1]%i == 0)
						{
							System.out.println(i);
							break;
						}
					}
				long LCM = 1;
					for(long i = 2; num[1] != i;)
					{
						if(num[0]%i == 0 && num[1]%i == 0)
						{
							num[0] = num[0]/i;
							num[1] = num[1]/i;
							LCM = LCM * i;
						} else {
							i++;
						}
					}
				System.out.println(LCM * num[0] * num[1]);
			}
	}
}