Binod and Chocolates

CodeChefOpen on judge ↗

Binod recently fell in love. Binod planned to gift chocolates to Binod. There are $N$ different shops selling chocolates and each shop sells a different variety of chocolate i.e each shop has *distinct chocolate* among all other shops. Each shop can sell atmost $C_{i}$ chocolates only. Binod bought boxes of size $M$ and he can only gift the box if 1. Box is completely filled with exactly $M$ cho

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