← All problemsSign in

Can You Reach The End

CodeChefRating 2095Open on judge ↗

You are given a positive integer $N$. Consider a square grid of size $N \times N$, with rows numbered $1$ to $N$ from top to bottom and columns numbered $1$ to $N$ from left to right. Initially you are at $(1,1)$ and you have to reach $(N,N)$. From a cell you can either move one cell to the right or one cell down (if possible). Formally, if you are at $(i,j)$, then you can either move to $(i+1,j)$

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