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

public class Main{

	public static void main(String argv[]) throws IOException {
		InputStreamReader is = new InputStreamReader(System.in);
		BufferedReader br = new BufferedReader(is);
		String str;
		String Array[] = new String[2];
		long a, b;
		long saidaikouyakusu=0;
		while ((str = br.readLine()) != null) {
			Array = str.split(" ");
			a = Integer.parseInt(Array[0]);
			b = Integer.parseInt(Array[1]);
			saidaikouyakusu=gcd(a,b);
			System.out.printf("%d %d\n", saidaikouyakusu, a * b/saidaikouyakusu);

		}
	}

	public static long gcd(long a,long b){
		long min;
		long result=0;
		if (a > b) {
			min = b;
		} else
			min = a;

		if(min==1)min=2;
		for (int i = 1; i <= min/2; i++) {
			if (a % i == 0 && b % i == 0 && result<i)result=i;

		}
		return result;
	}

}