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 C# (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.ComponentModel;

public class GcdAndLcm
{
	public static void Main(string[] args)
	{
		BindingList<string> outputList = new BindingList<string>();
		do
		{
			string input = Console.ReadLine();
			if (string.IsNullOrEmpty(input))
			{
				break;
			}
			string[] inputList = input.Split(' ');
			ulong divideBy = ulong.Parse(inputList[0]);
			ulong divide = ulong.Parse(inputList[1]);
			if (ulong.Parse(inputList[1]) > ulong.Parse(inputList[0]))
			{
				divideBy = ulong.Parse(inputList[1]);
				divide = ulong.Parse(inputList[0]);
			}
			ulong gcd = 1;
			do
			{
				ulong quotient = divideBy % divide;
				if (quotient == 0)
				{
					gcd = divide;
					break;
				}
				divideBy = divide;
				divide = quotient;
			} while (true);
			ulong lcm = (ulong.Parse(inputList[0]) * ulong.Parse(inputList[1])/gcd);
			outputList.Add(gcd + " " + lcm);
		} while(true);
		
		foreach (string output in outputList)
		{
			Console.WriteLine(output);
		}
	}
}