Problem 59526. Count paths between corners of a grid that remain on or below the diagonal
Consider motion from the lower left corner of a square grid to the upper right corner. The motion is constrained in two ways: (1) the only legal moves are (0,1), (1,0), and (1,1)—i.e., right, up, and up-and-right between points of the lattice—and (2) the motion must remain on or below the line connecting the starting and finishing corners. For a 2x2 grid, the number of paths is 6, as shown below.
Write a function to count the legal paths for an nxn grid. Return the count as a string. Check the last test for banned functions.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
5771 Solvers
-
2848 Solvers
-
Remove the small words from a list of words.
1448 Solvers
-
107 Solvers
-
Circular Primes (based on Project Euler, problem 35)
470 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!