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 C (judge verdict: Time Limit Exceeded)

#include <stdio.h>
int euclidean(int,int);

int main(void) {
	long a,b,j;
	while(EOF!=scanf("%d %d",&a,&b)){
	    long mini=a,big=b;
	    if(a>b){
	        mini=b;
	        big=a;
	    }
	    for(j=a;j%a!=0 || j%b!=0;j=j+a);
		printf("%d %d\n",euclidean(mini,big),j);
	}
	return 0;
}
int euclidean(int x,int y){
    long z=x;
    do{
        x=y;
        y=z;
		z=x%y;
	}while(0!=z);
	return y;
}