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 max_bai(long a long b);*/

int min_yaku(long a, long max ,long b);

int main(void)
{
        unsigned long a = 0, b = 0, min = 0, max = 0;
        unsigned long i = 0 ,t = 0, j = 0, m = 0, n = 0,r = 0;

        while(scanf("%ld %ld", &a , &b) != EOF)
        {
                if(a == b)
                {
                        max = a;
                        min = min_yaku(a, max, b);
                        printf("%ld %ld\n", max, min);
                }
                else
                {
                        r = a-b;
                        i = r;
                        while(1)
                        {
                                if(b % i == 0 && r % i == 0)
                                {
                                        max = i;
                                        min = min_yaku(a, max, b);
                                        printf("%ld %ld\n", max, min);
                                        break;
                                }
                                i--;
                        }
                }
        }
        return 0;
}
/*
int max(long a long b);
{


}
*/

int min_yaku(long a ,long max ,long b)
{
        long min=0;
        min = a / max * b;
        return min;
}