← All problemsSign in

Construct N

CodeChefRating 860Open on judge ↗

You are given an integer $N$. Find if it is possible to represent $N$ as the sum of several(possibly zero) $2$'s and several(possibly zero) $7$'s. Formally, find if there exist two integers $X, Y \ (X, Y \ge 0)$ such that $2 \cdot X + 7\cdot Y = N$. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of a single lin

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