← All problemsSign in

AB plus C

CodeChefRating 1569Open on judge ↗

Chef has an integer $X$ and wants to find out **any** triplet $(A, B, C)$ such that: - $1 \leq A, B, C \leq 10^6$; - $A \cdot B + C = X$ If no such triplet exists, print $-1$ instead. ### 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 integer $X$, as mentioned in the statement. ### Output For each test

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