Balloon Smash Party

CodeChefRating 1373Open on judge ↗

There are $N$ friends at a party playing a game called **Balloon Smash**. Each friend $i$ has an *annoyance factor* $A_i$. If the $i$-th friend is hit by $A_i$ balloons, they immediately leave the party. The game proceeds according to the following rules: - The friends take turns sequentially from $1$ to $N$. - If the current friend has already left the party, the turn moves to the next friend.

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