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;
class main
{
    static void Main(string[] args)
    {
        while (true)
        {
            string s = Console.ReadLine();

            if (s != null)
            {
                int i = 0; 
                string[] s1 = s.Split(' ');
                long[] a = new long[2];
                long[] l = new long[2];
                a[0] = long.Parse(s1[0]);
                a[1] = long.Parse(s1[1]);

                Array.Sort(a);

                long c = a[0] * a[1];

                l[0] = a[1] % a[0];
                if (l[0] != 0)
                {
                    l[1] = a[0] % l[0];
                    if (l[1] != 0)
                    {
                        while (true)
                        {
                            Array.Resize(ref l, i + 3);
                            l[i + 2] = l[i] % l[i + 1];
                            if (l[i + 2] == 0)
                            {
                                break;
                            }
                            ++i;
                        }
                        Console.WriteLine("{0} {1}", l[i + 1], (c / l[i + 1]));
                    }
                    if (l[1] == 0)
                    {
                        Console.WriteLine("{0} {1}", l[0], (c / l[0]));
                    }
                }
                if (l[0] == 0)
                {
                    Console.WriteLine("{0} {1}", a[0], (c / a[0]));
                }
                

            }
            if (s == null)
            {
                break;
            }
            //Console.ReadKey();
        }
    }
}