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 ConsoleApplication
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                var str = Console.ReadLine();
                if (string.IsNullOrEmpty(str)) return;
                var a = str.Split(' ').Select(s => int.Parse(s));
                var g = gcd(a.ElementAt(0), a.ElementAt(1));
                var l = lcm(a.ElementAt(0), a.ElementAt(1), g);
                Console.WriteLine("{0} {1}", g, l);
            }
        }

        static int gcd(int a, int b)
        {
            if (a == 0 || b == 0) return 0;
            while (a != b)
            {
                if (a > b) a -= b;
                else b -= a;
            }
            return a;
        }

        static int lcm(int a, int b, int gcd)
        {
            if (a == 0 || b == 0) return 0;
            return (a / gcd) * b;
        }
    }
}