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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line="";
		while((line = br.readLine())!=null){
			String[] s =line.split(" ");
			long a = Long.parseLong(s[0]);
			long b = Long.parseLong(s[1]);
			if(a>b){
				System.out.println(gcd(b,a)+" "+lcm(b,a));
			}else{
				System.out.println(gcd(a,b)+" "+lcm(a,b));
			}
		}
	}
	public static long gcd(long m, long n){
		if(n == 0)
			return m;
		else
			return gcd(n, m % n);
	}
	public static long lcm(long m, long n){
		return m * n / gcd(m, n);
	}
}