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>

#define MIN(a,b) (((a)>(b))?(b):(a))

int main(void)
{
    //for debug
    FILE *fin, *fout;
//#define DEBUG
#ifdef DEBUG
    fin=fopen("input.txt","r");
    fout=fopen("output.txt","w");
#else
    fin=stdin; fout=stdout;
#endif

    //process all input data
    while(feof(fin)==0){
        int a,b;
        fscanf(fin,"%d %d\n",&a,&b);
        int i;
        //gcd is at least 1
        int gcd=1;
        //divider is 1..Minimum(a,b)
        for(i=MIN(a,b);i>=1;i--){
            if(a%i==0 && b%i==0){ gcd=i; }
        }
        //calc lcm
        long long int lcm=gcd*(a/gcd)*(b/gcd);
        //write result
        fprintf(fout,"%d %lld\n",gcd,lcm);
    }


    return 0;
}