← All problemsSign in

Test Score

CodeChefRating 610Open on judge ↗

In a test, there are $N$ problems, each carrying $X$ marks. In each problem, Chef either received $X$ marks or $0$ marks. Determine whether is it possible for Chef to achieve **exactly** $Y$ marks. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of three integers $N, X,$ and $Y$, the number of problems, the max

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