yes

101. Safehouse Access

Time Limit: 1 seconds

Memory Limit: 256 MB

Rating: 1200

The mastermind’s safehouse is at the top of a towering staircase. The only way to reach the safehouse is by climbing the stairs, and the guards have set a rule: you can climb either 1 or 2 steps at a time. Determine how many distinct ways you can climb to the top. Input is denoted by an integer $N$, the total number of steps in the staircase. Each step can be taken as a single step or as part of a double step. The output should be the total number of distinct ways to climb to the top. For example, for $N = 4$, there are $5$ distinct ways to climb: $(1+1+1+1), (1+2+1), (2+1+1), (1+1+2), (2+2).$

You are given an integer $N$. $1 \le N \le 1{,}000$

Output the answer described in the problem statement.

Sample Input 1:
4

Sample Output 1:
5

Note: This problem may be unsolvable in some programming languages due to the large input size.

KL Coding Cup March 2025 > Speed Round > Problem 6