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(void)
{
	int a,b,w,ax,bx;
	int ya,ba;
	int i,j,on=0;
	while( scanf("%d %d",&a,&b)!=EOF ){
		if(a<b){
			w=a;
			a=b;
			b=w;
		}
		ax=a;
		bx=b;
		for(i=1 ; i<=a ; i++){
			a=ax*i;
			b=bx;
			for(j=1 ; j<a ; j++){
				b=bx*j;
				if(a==b){
					on=1;
					ba=a;
					break;
				}
			}
			if(on==1)
				break;
		}
		a=ax;
		b=bx;
		if(a%b==0){
			ya=b;
		}
		else{
			for(i=bx ; i>=2 ; i--){
				a=ax/i;
				b=bx/i;
				if(ax%i==0 && bx%i==0){
						ya=i;
						break;
				}
			}
		}
		printf("%d %d\n",ya,ba);
	}
	return 0;
}