There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top.
Files
Latest commit
This branch is up to date with matthewsamuel95/ACM-ICPC-Algorithms:master.
Recursive_Staircase_Problem
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||