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

public class Main {
	 
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 
        String s;
        while ((s = br.readLine()) != null) {
            String[] lc = s.split(" ");
            int a = Integer.parseInt(lc[0]);
            int b = Integer.parseInt(lc[1]);
            
            int gcd = gcd(a,b);
            int lcm = a / gcd * b;
            
            System.out.println(gcd + " " + lcm);
        }
 
    }
    
    private static int gcd(int a, int b) {
    	while(b!=0){
    		int aa = a;
    		a = b;
    		b = aa%b;
    	}
    	return a;
    }
}