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(){
  int a,b,ans1=0,ans2=0,i;
  scanf("%d %d",&a,&b);
  if(a<b){
    i=a;a=b;b=i;
  }
  for(i=b;i>0;i--){
    if((a%i==0) && (b%i==0)){
      ans1=i;
      break;
    }
  }
  i=a;
  while(1){
    if((i%a==0) && (i%b==0)){
      ans2=i;
      break;
    }
    i++;
  }
  printf("%d %d\n",ans1,ans2);
  return(0);
}