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 argc, char *argv[])
{
        char buf[64];
        long int a, b, tmp;
        long int GCD, LCM;

        while (fgets(buf, 64, stdin)) {
                sscanf(buf, "%ld %ld", &a, &b);
                if (a > b) {
                        tmp = a;
                        a = b;
                        b = tmp;
                }
                GCD = ((b - a) > a)? a : b - a;
                for (; GCD > 0; GCD--) {
                        if ((a % GCD == 0) && (b % GCD == 0))
                                break;
                }
                if (GCD != 0)
                        LCM = a / GCD * b;
                else
                        LCM = 0;
                printf("%ld %ld\n", GCD, LCM);

        }
        return 0;
}