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: Time Limit Exceeded)

import java.util.Scanner;

class Main{

	public static void main(String args[]){

		Scanner sc = new Scanner(System.in);

		while(sc.hasNext()){

			long num1 = sc.nextInt();
			long num2 = sc.nextInt();
			long divisor;
			long multiple;


	        for (multiple = 1; multiple <= num1 * num2; multiple++) {
	            if ((multiple % num1 == 0) && (multiple % num2 == 0)) {

	                break;
	            }
	        }

	        for (divisor = num1; divisor >= 1; divisor--) {
	            if ((num1 % divisor == 0) && (num2 % divisor == 0)) {
	                break;
	            }
	        }//for
	        System.out.printf("%d %d", divisor , multiple);
		}
	}
}