Problème
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.
Contraintes
1 ≤ lo ≤ hi ≤ 40 (the answer fits in a signed 64-bit integer)
Exemples
Entrée :
lo = 1
hi = 6
Sortie attendue :
expected = 60
Entrée :
long long lo = 1;
long long hi = 6;
Sortie attendue :
long long expected = 60;
Entrée :
long lo = 1;
long hi = 6;
Sortie attendue :
long expected = 60;
Explication
60 is divisible by 1, 2, 3, 4, 5 and 6, and no smaller positive number is, so the answer is 60.
Entrée :
lo = 4
hi = 6
Sortie attendue :
expected = 60
Entrée :
long long lo = 4;
long long hi = 6;
Sortie attendue :
long long expected = 60;
Entrée :
long lo = 4;
long hi = 6;
Sortie attendue :
long expected = 60;
Explication
lcm(4, 5) = 20 and lcm(20, 6) = 60, so the answer is 60 again: the small sizes added nothing.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
The lcm of a whole range can be built one number at a time.
Indice 2
lcm(a, b) = a / gcd(a, b) × b.
Indice 3
Divide before you multiply so the intermediate value never gets bigger than the answer.
Complexité attendue
O(n log M) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.