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 Bigyaku(int,int);
int Bigbai(int,int);

main(){
int a,b;
int bai,yaku;

while(scanf("%d%d",&a,&b)!=EOF){
bai=Bigbai(a,b);
yaku=Bigyaku(a,b);
printf("%d %d\n",yaku,bai);
}	
}

int Bigyaku(int a,int b){
int i;
int dai;
for(i=2;i<a;i++){
if(a%i==0 && b%i==0) dai=i;
}
return dai;
}

int Bigbai(int a,int b){
int i,j;
int k=0;
for(j=1;j<a;j++){
for(i=1;i<b;i++){
if(b*j==a*i){
k=1;
break;
}
if(b*j<a*i){
break;
}
}
if(k==1) break;
}
if(k==0) return a*b;
return b*j;
}