In how many ways can you travel from the left top corner to the right bottom corner of an M X N grid where M = 30 and N = 20 with the following constraints ( believe me. these constraints make the problem more easy :-) )?

- Traveling is allowed only on the borders of the squares.
- You can travel only rightwards or downwards.

Note: M is the number of rows. N is the number of columns. an M X N grid contains M*N squares.

For example: a 2X2 grid, we have 6 ways to traverse as given in the illustration.

(Sorry for the shabby illustration. I am a really impatient guy :-P)

×

Problem Loading...

Note Loading...

Set Loading...