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 Solvers7
Suggested Problems
-
Maximum running product for a string of numbers
2257 Solvers
-
2095 Solvers
-
4503 Solvers
-
322 Solvers
-
Return the first and last characters of a character array
12253 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!