Chocolate Distribution

CodeChefOpen on judge ↗

Chef is has $N$ chocolates. He wants it to be distributed equally with his $K$ friends. Print how many chocolates are left after distribution. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, two integers $N, K$. ### Output For each testcase, output in a single line integer, number of chocolates left.

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