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 i,a[100]={},b[100]={},x,y,z;
	for(i=0;i<100;i++){
	scanf("%d %d",&a[i],&b[i]);
	}
	for(i=0;i<100;i++){
	x=a[i];
		while(1){
		if(a[i]%x == 0 && b[i]%x == 0){
		printf("%d ",x);
		break;
	}
		else x--;
	}
	y=1;
	z=1;
		while(1){
		if(a[i]*y == b[i]*z){
		printf("%d\n",a[i]*y);
		break;
	}
		else if(a[i]*y < b[i]*z){
		y++;
	}
		else if(b[i]*z < a[i]*y){
		z++;
	}
	}
	}
return 0;
}