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

class Program
{
    static void Main(string[] args)
    {
        foreach (var input in Enumerable.Range(0, int.MaxValue).Select(x => Console.ReadLine()).TakeWhile(x => !string.IsNullOrEmpty(x)))
        {
            var values = input.Split(' ').Select(int.Parse).ToArray();
            Console.WriteLine("{0} {1}", Gcd(values[0], values[1]), Lcm(values[0], values[1]));
        }
    }
    private static int Gcd(int m, int n)
    {
        if (m < n)
        {
            return Gcd(n, m);
        }
        else if (n == 0)
        {
            return m;
        }
        else
        {
            return Gcd(n, m % n);
        }
    }
    private static int Lcm(int m, int n)
    {
        return m / Gcd(m, n) * n;
    }
}