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

public class Main {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		int a = scan.nextInt();
		int b = scan.nextInt();
		
		int max = Math.max(a, b);
		int min = Math.min(a, b);
		
		//?????§??¬?´???°
		int yakusu = 0;
		int cal = 0;
		
		for(;true;){
			cal = max % min;
			max = min;
			min = cal;
			
			if(min==0){ 
				yakusu = max;
				break;
			}
		}
		
		//????°???¬?????°
		int baisu = 0;
		baisu = a * b / yakusu;
		
		System.out.println(yakusu+" "+baisu);
		
	}
}