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;

namespace AOJ
{
    class GcdAndLcm
    {
        public static void Main()
        {
            while (true)
            {
                string input = Console.ReadLine();
                if (string.IsNullOrEmpty(input)) { break; }

                var tmp = input.Split(' ');
                int large = Math.Max(int.Parse(tmp[0]), int.Parse(tmp[1]));
                int small = Math.Min(int.Parse(tmp[0]), int.Parse(tmp[1]));

                int gcd = 0, lcm = 0;
                if (small == 0) { gcd = 0; }
                else
                {
                    int mod = large % small;
                    while (mod > 0)
                    {
                        large = small;
                        small = mod;
                        mod = large % small;
                    }
                    gcd = small;
                    lcm = int.Parse(tmp[0]) * (int.Parse(tmp[1]) / gcd);
                    Console.WriteLine(string.Format("{0} {1}", gcd, lcm));
                }
            }
        }
    }
}