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.util.*;

public class Main {
    public static void main (String[] args) {
        Scanner scanner = new Scanner(System.in);
       
        while (scanner.hasNext()) {
            long x0 = scanner.nextLong();
            long y0 = scanner.nextLong();
            
            long x = x0;
            long y = y0;
            long gcd = 0;
            long lcm = 0;
            
            while (x != y) {
                if (y > x) {
                    long temp = y;
                    y = x;
                    x = temp;
                }
                x = x - y; 
            }
            gcd = x;         
            lcm = x0 * y0 /gcd;
            System.out.println(gcd + " " + lcm);
        }
    }
}