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 main(){
  int a, b, n, gcd, lcm, i, stock, x, y;

  while(scanf("%d %d",&a,&b) != EOF){
    //Ååöñ

    if(a < b){
      stock = x;
      x = y;
      y = stock;
    }else{
      x = a;
      y = b;
    }

    while(1){
      x = x % y;
      
      stock = x;
      x = y;
      y = stock;

      if(y == 0){
	gcd = x;
	break;
      }
    }

    //Å¬ö{
    if(a > b){
      n = a;
    }else{
      n = b;
    }
    for(i = n; i < 2000000000; i++){
      if(i % a == 0 && i % b == 0){
	lcm = i;
	break;
      }
    }

    printf("%d %d\n",gcd,lcm);
  }

  return 0;
}