Jon and Candies

CodeChefOpen on judge ↗

Jon has $N$ number of boxes of candies to distribute among his three brothers. Number of candies in a box is represented using an array $A$ where $A_i$ represents the number of candies in box $i$. Find the maximum number of boxes which Jon can distribute evenly among his three brothers. ### Input - First line will contain $T$, number of testcases. Each testcase contains of two lines of input. -

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