//最大公约数
int gcd(int a, int b)
{while(b != 0)
{
int r = b;
b = a % b;
a = r;
}
return a;
}
//least common multiple
int lcm(int a, int b)
{
return a*b/gcd(a, b);
}
//最大公约数
int gcd(int a, int b)
{}
//least common multiple
int lcm(int a, int b)
{
return a*b/gcd(a, b);
}