BIRTHDAY PARTY

CodeChefOpen on judge ↗

You are having a birthday party for your child. There are $n$ kids gathered in the party (your child included) and they want to play a game in which, in every round $1$ kid has to supervise while the other $n -1$ kids play. You’re given an array where the $i$ - th kid wants to play $ai$ rounds. What is the minimum number of rounds of the game they need to play to let each kid play at least as many

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