Simple Problem

CodeChefOpen on judge ↗

Problem Description Given a value N, maximize the value of (a+b) such that (a*a-b*b = N). Note: The value of N is odd. a and b are integers. Input The first line consists of test case T. Each testcase consists of the value of N. Output Print the value of max(a+b). Constraints - 1 ≤ T ≤ 100000 - 1 ≤ N ≤ 1018 Example Input: 1 1 Output: 1 Explanation The value of a2 - b2 is 1. The

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