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: Wrong Answer)

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while(in.hasNext()) {
			int a = in.nextInt();
			int b = in.nextInt();
			int tmp = 0;
			boolean judge = false;
			for(int i=1; i<a; i++) {
				for(int j=1; j<b; j++) {
					if(a*i == b*j) {
						tmp = a*i;
						judge = true;
					}
					if(a*i < b*j) break;
				}
				if(judge) break;
			}
			judge = false;
			while(true) {
				int r = a%b;
				if(r==0) {
					System.out.print(b + " " + tmp);
					break;
				} else {
					a = b;
					b = r;
				}
			}
		}
	}
}