The stair has n steps. Every times you can up one or two steps. Give all the different solutions to upstairs.
For example n = 4.
sols = {[1,1,1,1],[1,1,2],[1,2,1],[2,2]}
n = 5
sols = {[1,1,1,1,1],[1,1,1,1,2],[1,1,2,1],[1,2,1,1],[1,2,2],[2,1,1,1],[2,1,2],[2,2,1]}
Have fun!
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Maximum running product for a string of numbers
2254 Solvers
-
230 Solvers
-
64 Solvers
-
52 Solvers
-
Choose the best fitting dominoes
243 Solvers
More from this Author17
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!