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 calc_gcd(int, int);
int calc_lcm(int, int, int);

int main(void) {
    int a, b, gcd, lcm;

    while(scanf("%d %d", &a, &b) != EOF) {
        if(a <= b) {
            gcd = calc_gcd(a, b);
            lcm = calc_lcm(a, b, gcd);
        } else {
            gcd = calc_gcd(b, a);                                                                                                                                                                                                 
            lcm = calc_lcm(b, a, gcd);
        }
        printf("%d %d\n", gcd, lcm);
    }

    return 0;
}

int calc_gcd(int small, int large) {
    int gcd = small;

    while(gcd >= 1) {
        if((small % gcd == 0) && (large % gcd == 0)) break;
        gcd--;
    }

    return gcd;
}

int calc_lcm(int small, int large, int gcd) {
    if(large % small == 0) return large;

    int lcm = large;
    int x = 1;
    while(lcm < 2000000000) {
        lcm = large * gcd * x;
        if(lcm % small == 0) break;
        x++;
    }

    return lcm;
}