Zzuli: maximum Convention and minimum common multiple

Title Description

Enter two positive integers , Output its maximum common divisor and minimum common multiple .

Input

Enter two positive integers n and m（n,m<=1000000). Input to ensure that the final result is int Within the scope of .

Output

Output two integers , Space off . Express m and n The greatest common divisor and the least common multiple of .

The sample input  Copy

4 6

Sample output  Copy

2 12

Tips

Pay attention to the overflow problem in the operation process

#include <stdio.h>
int main()
{
	int m,n,r,i,a,b;
	scanf("%d%d",&m,&n);
	a=n;
	b=m;
	while(m%n!=0)
	{
		r=m%n;
		m=n;
		n=r;
	}
	i=b/n*a;
	printf("%d %d",n,i);
	return 0;
}