Candy Division

CodeChefRating 289Open on judge ↗

There are **three** friends and a total of $N$ candies. There will be a fight amongst the friends if all of them do **not** get the same number of candies. Chef wants to divide **all** the candies such that there is **no fight**. Find whether such distribution is possible. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test ca

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