Paths

CodeChefOpen on judge ↗

Chef is very much interested in Geometry. He has drawn an isosceles right angled triangle on a graph paper. The base length of the triangle is N units. The co-ordinates of the vertices of the triangle are $(0, 0)$, $(N, 0)$ and $(N, N)$. The graph paper is divided into grids where each grid length is equal to one unit. Chef is trying to find the total number of possible paths from $(0, 0)$ to $(N,

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