Climbing stairs
easy
Read n. You climb a staircase of n steps, one or two steps at a time. Print how many different ways there are to reach the top.
Example 1: input
2
Output
2
Example 2: input
3
Output
3
Plus 3 hidden tests when you check your answer.
Your solution
Read from standard input and print the answer. Run it on the examples as often as you like, then check it against every test.
Stuck?
Open hints one at a time. The write-up explains a full solution.
Discussion
Ask a question or share a tip. Please don’t post full solutions. Posts appear once a moderator approves them.
No posts yet.