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: Wrong Answer)

#include <stdio.h>
int main(void) {
   int a,b,i,temp;
   while(scanf("%d %d",&a,&b)!=EOF){
   if(a>b){temp=a;a=b;b=temp;}
   for(i=a;i>=1;i--){
	   if(a%i==0 && b%i==0){printf("%d ",i);break;}
   }
   for(i=2;i<=a;i++){
	   if((b*i)%a==0){printf("%d ",b*i);break;}
   }
   printf("\n");
   }
   return 0;
}