Problem 2176. Which way to go?
Solution Stats
Problem Comments
-
3 Comments
I think your answers in the test suite are for an (m+1)x(n+1) grid, as there are only two ways to reach the bottom right for a 2x2 grid. Check out http://www.mathworks.com/matlabcentral/cody/problems/1483-number-of-paths-on-a-grid for more details.
There are 6 ways of reaching the bottom right corner of a 2*2 grid. Are you considering m*n lines or m*n boxes?
I was considering m*n vertices, not boxes. If you have a 2x2 grid of boxes (3x3 vertices), then you're correct; there are six ways to reach the bottom. Just some miscommunication there.
Problem Recent Solvers67
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
43423 Solvers
-
1037 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
1661 Solvers
-
Replace multiples of 5 with NaN
413 Solvers
-
Matlab Basics - Convert a row vector to a column vector
558 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!