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 factor;
int num_a,num_b,i,j,num_max;

int main(){
	while(scanf("%d %d",&num_a,&num_b)!=EOF){
		factor=1;
		if(num_a<=num_b)num_max=num_a;
		if(num_a>num_b)num_max=num_b;
		for(i=2;i<=num_max;i++){
			if(num_a%(num_max+2-i)==0&&num_b%(num_max+2-i)==0){
				factor=(num_max+2-i);
				break;}
		}
		printf("%d %d\n",factor,num_a/factor*num_b);
	}
	return 0;
}