Count Numbers

CodeChefOpen on judge ↗

You are given a number "n" and you have to find two maximum consecutive numbers whose sum is equal to "n". If there doesn't exist such numbers print "-1 -1". ### Input - First line will contain T, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, one integer n. ### Output For each testcase, output in a single line answer containing two integers

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