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 gcm(int a, int b)
{

    int h, i, k = 1;

    if(a > b)
        h = a;
    else
        h = b;

    for(i = 1; i <= h; i++) {
        if(a % i == 0 && b % i == 0) {
            a /= i;
            b /= i;
            k *= i;
        }
    }

    return k * a * b;
}

int lcm(int a, int b)
{

    int temp, x, k = 1;

    if(a < b) {
        temp = a;
        a = b;
        b = temp;
    }

    while(k) {
        x = a % b;
        if(x == 0)
            return b;

        a = b % x;
        if(a == 0)
            return x;

        b = x % a;
        if(b == 0)
            return a;
    }

}

int main(void)
{

    int n, a, b, c, i;

    while(scanf("%d %d", &a, &b) != EOF)
        printf("%d %d\n", lcm(a, b), gcm(a, b));

    return 0;
}