Final Position after N steps

CodeChefOpen on judge ↗

Given a 2D Cartesian plane. Initially, you are at (0,0) position. Now, you are asked to take $N$ steps. For every step $i$, if $i$ is odd, you will move $i$ positions towards right. If $i$ is even, you will move $i$ position upwards. Find your final position after $N$ steps. ### Input - The only line contains an integer $N$ - the number of steps. ### Output Print in a single line two integers X

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