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

public class Main {

	private Main() {
		Scanner in = new Scanner(System.in);
		long a,b;
		while(in.hasNext()){
			a = in.nextInt();
			b = in.nextInt();
			System.out.println(gcd(a,b)+" "+lcm(a,b));
		}
	}

	public long gcd(long a, long b) {
		if(a==b){
			return a;
		} else if(a>b) {
			return gcd(b,a-b);
		} else {
			return gcd(a,b-a);
		}
	}

	public long lcm(long a, long b) {
		return a*b/gcd(a,b);
	}

	public static void main(String[] args) {
		new Main();
	}
}