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>

main(){
  unsigned int a, b, temp1, temp2, ans1, ans2;
  int i;


  while(1){
    if(scanf("%d %d", &a, &b)==EOF) break;

    if(a>=b){
      temp1=b;
      temp2=a;
    }
    else{
      temp1=a;
      temp2=b;
    }

    for(i=temp1;i<=a*b;i++){
      if(i%a==0 && i%b==0){
	ans2=i;
	break;
      }
    }

    for(i=temp2;i>0;i--){
      if(a%i==0 && b%i==0){
	ans1=i;
	break;
      }
    }

    printf("%d %d\n", ans1, ans2);
  }
  return 0;
}