Distribute It!

CodeChefOpen on judge ↗

*We prepared this question in the last minute so we didn't have time to come up with a story. Sorry.* There are $n$ types of liquids and they are numbered from $1$ to $n$. Currently we have $a_i$ packets of liquid $i$. Each packet has a capacity of $c$ litres. We have $n$ containers. Liquid $1$ does not mix with any other liquid and all other liquids mix with each other. We need to distribute a

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.

voice by Sarvam AI