Agent Binod

CodeChefOpen on judge ↗

*Binod* after losing all hopes in life has now started a new job in the city as a theater agent. There are $n$ theaters in the city. Each theater has a very weird way for allowing their audiences. There is also a queue of $n$ people. Each theater in the city has a condition that if the sum of money collected from the first *i* (*1*<= *i* <= *n*) customers starting from the beginning of the queue

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