समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।