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: Wrong Answer)

#include<stdio.h>

int min(int a,int b)
{
	if(a<b)
		return a;
    else 
		return b;
}

int max(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}

int gys(int a,int b)
{
	int i,c=1;
	for(i=1;i<=min(a,b);i++)
	{
		if(a%i==0&&b%i==0)
			c=i;
	}
	return c;
}

int gbs(int a,int b)
{
	int i,c=1;
	for(i=a*b;i>=max(a,b);i--)
	{
		if(i%a==0&&i%b==0)
			c=i;
	}
	return c;
}

int main()
{
	int a,b;
	scanf("%d%d",&a,&b);
	printf("%d ",gys(a,b));
	printf("%d ",gbs(a,b));
	return 0;
}