求最大公约数与最小公倍数——辗转相除法

//求最大公约数，辗转相除法
unsigned gcd(unsigned x, unsigned y)
{
unsigned temp;
if (x < y){
temp = y;
y = x;
x = temp;
}
while (y != 0)
{
temp = x%y;
x = y;
y = temp;
}
return x;
}


//求最小公倍数
unsigned lcm(unsigned x, unsigned y)
{
unsigned temp;
unsigned result = x*y;


if (x < y){
temp = y;
y = x;
x = temp;
}
while (y != 0)
{
temp = x%y;
x = y;
y = temp;
}
return result/x;
}