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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(sc.hasNext()){
			int[] num = new int[2];
			num[0]=sc.nextInt();
			num[1]=sc.nextInt();
			
			int cd0;
			int cd = 1;
			
			do{
				cd0 = 1;
				for(int j = 2; j<= getMin(num[0], num[1]); j++){
					if(num[0]%j == 0 && num[1]%j == 0){
						cd0 = j;
						cd = cd * j;
						num[0]=num[0]/j;
						num[1]=num[1]/j;
						break;
					}
				}
			}while(cd0 != 1);
			
			System.out.print(cd + " ");
			System.out.println(cd * num[0] * num[1]);
		}
	}
	
	private static int getMin(int a, int b){
		if (a>b){
			return a;
		}else{
			return b;
		}
	}
}