Donation Drive

CodeChefRating 272Open on judge ↗

A blood drive aims to collect $N$ number of blood donations. The drive has collected $X$ donations so far. Find the remaining number of donations needed to reach the target. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case contains two space-separated integers $N$ and $X$ — the number of required donations and the number

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