Условие
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
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. Следуйте условию и ограничениям выше.