← All problemsSign in

High Accuracy

CodeChefRating 580Open on judge ↗

There are $100$ questions in a paper. Each question carries `+3` marks for correct answer, `-1` marks for incorrect answer and `0` marks for unattempted question. It is given that Chef received exactly $X$ $(0 \leq X \leq 100)$ marks. Determine the **minimum** number of problems Chef marked **incorrect**. ### Input - First line will contain $T$, number of test cases. Then the test cases follow.

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

Sign in to chat with the tutor and save your progress.

Sign in to start