← All problemsSign in

Path Parity

CodeChefRating 1098Open on judge ↗

You are given an integer $N$. Let $A$ be an $N \times N$ grid such that $A_{i, j} = i + N\cdot(j-1)$ for $1 \leq i, j \leq N$. For example, if $N = 4$ the grid looks like: ![](https://s3.amazonaws.com/codechef_shared/download/Images/START41/ss4.png) You start at the top left corner of the grid, i.e, cell $(1, 1)$. You would like to reach the bottom-right corner, cell $(N, N)$. To do so, whenever

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

Sign in to chat with the tutor and save your progress.

Sign in to start