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.*;
import java.math.*;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        int x;
        int y;

        int a = 0;
        int b = 0;
        int c = 0;
 
        while(sc.hasNext()){
 
            x = sc.nextInt();
            y = sc.nextInt();

            a = x;
            b = y;

            while(a != b){
                if(a >= b){
                    c = a;
                    a = b;
                    b = c - b;
                }else{
                    b = b - a;
                }
            }
            System.out.print(a);
            System.out.print(" ");
            System.out.println((x/a)*y); 
        }
    }
}