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.Threading.Tasks;

namespace Volume0005
{
    class Program
    {
        static long[] _numbers = new long[2];
        static long _number1 = 0;
        static long _number2 = 0;

        static void Main(string[] args)
        {
            string str = "";
            while ((str = Console.ReadLine()) != null)
            {
                _numbers = str.Split(' ').Select(long.Parse).ToArray();
                _number1 = _numbers[0];
                _number2 = _numbers[1];
                Console.WriteLine(Calclation.Gcd(_number1, _number2) + " " + Calclation.Lcm(_number1, _number2));
            }
        }
    }
    class Calclation
    {
        static internal long Gcd(long a, long b)
        {
            if (a < b)
            {
                return Gcd(b, a);
            }
            long remainder = 0;
            while (b != 0)
            {
                remainder = a % b;
                a = b;
                b = remainder;
            }
            return a;
        }
        static internal long Lcm(long a, long b)
        {
            return a * b / Gcd(a, b);
        }
    }
}