ACM數論3--gcd 和 lcm

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; }

>>阅读原文<<