Arithmetic problem - Easy Version

CodeChefOpen on judge ↗

#####This is easy version of the problem. The difference between easy and hard version is in the properties of required integer. You are given a positive integer $N$. Find smallest integer $M$, such that $M >= N$ and $M$ can be represented as sum of consecutive odd numbers starting from 1. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each

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