Paths to a point
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 consists of two integral values(<50) indicating the x and y co-ordinates of a point with a space between them.
Output consists of number of ways A can move from origin to a given point as specified.
Input: 40 0 Output: 1
|Time Limit:||0.177778 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, JAVA, GO|
Fetching successful submissions