ACM数论3–gcd 和 lcm 1.gcd (最大公约数) LL gcd(LL a, LL b) { return b ? gcd(b, a%b) : a; } 2.lcm (最小公倍数) (lcm = a / gcd(a, b) * b) LL lcm(LL a, LL b) { return a * gcd(a, b) / b; }