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 SOSUU(int n){
        int m, count;
        count=0;
        for(m=1; m<=n; m++){
            if(n%m==0){
                count++;
            }
        }
        if(count==2){
            return 1;
        }
        else{
            return 0;
        }
    }
    
int main(void){
    int a, b, c, i, min, MAX;
    
    while(scanf("%d %d", &a, &b)!=EOF){
        if(a>b){
            c=a;
            a=b;
            b=c;
        }
        min=1;
        for(i=1; i<=a; i++){
            if(SOSUU(i)){
                if(a%i==0 && b%i==0){
                    min=min*i;
                }
            }
        }
        MAX=a*b/min;
        printf("%d %d\n", min, MAX);
    }
    return 0;
}