大招:
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a % b);
}
int y;
y = (a * b) / gcd(a,b);
cout << y << endl;
简易方法:
int lcm(int a, int b)
{
if(a > b) swap(a,b);
int x;
for(int i = a ; i >= 1 ; i --)
{
if(a % i == 0 && b % i == 0)
{
x = i;
break;
}
}
int y;
y = a * b / x;
return y;
}