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 JAVA (judge verdict: Accepted)

import java.io.BufferedInputStream;
import java.util.Scanner;

public class Main {

    static int gcd(int a, int b)
    {
        int t = a % b;
        while(t != 0)
        {
            a = b;
            b = t;
            t = a % b;
        }

        return b;
    }
    public static void main(String[] args)
    {
        int a, b, g;

        long l;

        Scanner cin = new Scanner(new BufferedInputStream(System.in));

        while(cin.hasNext())
        {
            a = cin.nextInt();
            b = cin.nextInt();

            g = gcd(a, b);
            l = 1L * a*b / g;
            System.out.print(g+" ");
            System.out.println(new Long(l).toString());
        }

    }
}