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.Generic;
using System.Linq;
using System.Text;

namespace AthleteProgramming
{
    class Program
    {
        static void Main()
        {
            string str;
            int[] ab;

            while (true)
            {
                str = Console.ReadLine();
                if (str == null)
                {
                    break;
                }
                ab = str.Split(' ').Select(int.Parse).ToArray();
                int a = ab[0];
                int b = ab[1];
                if (a < b)
                {
                    int tmp = b;
                    b = a;
                    a = tmp;
                }
                int r = a % b;
                while (r!=0)
                {
                    a = b;
                    b = r;
                    r = a % b;
                }
                Console.WriteLine("{0} {1}",b,(ab[0]/b)*(ab[1]/b)*b);
                    
            }
        }

       
    }
}