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(void){
  long int a,b,_a,_b,i;
  long int x,y;
  while(scanf("%ld %ld",&a,&b) != EOF){
    _a = a;
    _b = b;
    x = 1;
    y = 1;
    for(i=2;i<(a/2)&&i<(b/2);i++){
      while(_a%i==0 && _b%i==0){
        _a /= i;
        _b /= i;
        x *= i;
      }
    }
    y = a * b / x;
    printf("%ld %ld\n",x,y);
    }
    return 0;
}