算法-最大公约数，最小公倍数

void fun(int n,int m)
{
	int x = 0; int a = n*m;
	if (n< m)
	{
		x = n;
		n = m;
		m = x;
	}
	while (m!= 0)//判断是否能整除
	{
		x = n % m;
		n = m;
		m = x;
	}
	cout << n << " "<<a/n << endl;
}