Easiest Ever

CodeChefOpen on judge ↗

You are given an integer **$N$**. Your task is to find **any** two integers **$A,B$** such that $1\leq A , B \leq 2*N$ and difference of **$A$** and **$B$** exactly equals to **$N$** i.e. $A - B = N$. ###Input: - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first and only line of 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