문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.