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 _0005
{
    class Program
    {
        static void Main(string[] args)
        {
            string str;
            List<string> answer = new List<string>();
            while ((str = Console.ReadLine()) != null)
            {
                int[] number = str.Split(' ').Select(int.Parse).ToArray();
                int division = 0;
                Array.Sort(number);
                for (int i = number[0]; i <= number[0]; --i)
                {
                    if (Division(number, i) == true)
                    {
                        division = i;
                        break;
                    }
                    else
                    {

                    }
                }
                int a = number[1] * (number[0] / division);
                answer.Add(division.ToString() + " " + a.ToString());
            }

            foreach (string item in answer)
                Console.WriteLine(item);

        }

        static bool Division(int[] a, int i)
        {
            if (a[0] % i == 0 && a[1] % i == 0)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
    }
}