Take it Easy

CodeChefRating 1289Open on judge ↗

*Believe nothing you hear, and only one half that you see* On a Halloween evening, young Tim embarks on a candy-filled quest with his friends, dressed as ghouls and witches. There are $N$ friends, initially the $i$-th of them has $A_i$ candies. To truly savor the spooky spirit, Tim wishes for everyone to have an **equal** number of candies. To achieve this, he is armed with a magical operati

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