Paths to a point

CodeChefOpen on judge ↗

In a 2D co-ordinate system, A is situated at origin and he wants to move from origin to a point, he can move only parallel to X-axis or Y-axis . Once he takes a forward step he can't take backward. Your job is to find out number of ways to go from origin to a point. Input Input consists of two integral values(Output Output consists of number of ways A can move from origin to a given point as sp

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