問題
A bakery packs cookies into boxes of every size from lo to hi. It wants one batch size that fills boxes of any of those sizes with nothing left over. The answer is the smallest positive number divisible by every integer from lo to hi, which is their least common multiple.
Implement smallest_multiple(lo, hi).
Input
lo: The smallest box size.
hi: The largest box size.
Output
Return the smallest positive integer that each of lo, lo + 1, ..., hi divides with no remainder.
制約
1 ≤ lo ≤ hi ≤ 40 (the answer fits in a signed 64-bit integer)
例
入力:
lo = 1
hi = 6
期待される出力:
expected = 60
入力:
long long lo = 1;
long long hi = 6;
期待される出力:
long long expected = 60;
入力:
long lo = 1;
long hi = 6;
期待される出力:
long expected = 60;
解説
60 is divisible by 1, 2, 3, 4, 5 and 6, and no smaller positive number is, so the answer is 60.
入力:
lo = 4
hi = 6
期待される出力:
expected = 60
入力:
long long lo = 4;
long long hi = 6;
期待される出力:
long long expected = 60;
入力:
long lo = 4;
long hi = 6;
期待される出力:
long expected = 60;
解説
lcm(4, 5) = 20 and lcm(20, 6) = 60, so the answer is 60 again: the small sizes added nothing.
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
The lcm of a whole range can be built one number at a time.
ヒント 2
lcm(a, b) = a / gcd(a, b) × b.
ヒント 3
Divide before you multiply so the intermediate value never gets bigger than the answer.
目安の計算量
O(n log M) time, O(1) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。