← All problemsSign in

Numismatics

CodeChefRating 3003Open on judge ↗

There are $N$ slots in a row, numbered from $1$ to $N$ from left to right respectively. Each slot is either empty or has a coin in it. It is given that the $N^{th}$ slot is **always empty**. Whenever Chef is standing in $i^{th}$ slot, where $i^{th}$ slot is empty, he collects all the consecutive coins to his right, ie. he collects all the coins from $(i+1)^{th}$ to $(i+k)^{th}$ slot, assuming eac

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

Sign in to chat with the tutor and save your progress.

Sign in to start