Candy Distribution
Chef has $N$ candies. He has to distribute them to exactly $M$ of his friends such that each friend gets **equal** number of candies and each friend gets **even** number of candies. Determine whether it is possible to do so. **NOTE:** Chef will not take any candies himself and will distribute **all** the candies. ### Input - First line will contain $T$, number of test cases. Then the test cases
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.
Sign in to chat with the tutor and save your progress.
Sign in to start