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.Arrays;
import java.util.Scanner;

public class Main {
	static int gcd(int a, int b){
		if(b == 0) return a;
		return gcd(b,a % b);
    }
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		while(true){
			try{
				int a = in.nextInt();
				int b = in.nextInt();
				int min = gcd(a,b);
				int max = 1;
				for(int i = 2;i < Math.pow(a + b, 0.5) + 1;i++){
					if(a % i == 0 && b % i == 0){
						max = max * i;
						a = a / i;
						b = b / i;
						i--;
						System.out.println(a + ":" + b);
					}
				}
				max = max * a * b;
				System.out.println(min + " " + max);
			}catch(Exception e){
				System.exit(0);
			}
		}
	}
}