Boxes
CodeChefOpen on judge ↗
You have N pouches, each containing some number of marbles. The number of marbles contained in the ith box is denoted by ai. You need to put these pouches in at most M boxes. You can only choose consecutive pouches to put in a box. For each box, calculate the gcd of the number of marbles in each pouch in the box. Our goal is to find such a distribution of the pouches which maximizes the minimum gc
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start