You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1:Input: n = 2Output: 2Explanation: There are two ways to climb to the top.1. 1 step + 1 step2. 2 stepsExample 2:Input: n = 3Output: 3Explanation: There are three ways to climb to the top.1. 1 step + 1 step + 1 step2. 1 step + 2 steps3. 2 steps + 1 step Constraints:1 <= n <= 45

Let’s say we have a staircase of N steps, and a person has the ability to climbone, two, or three steps at a time. How many different possible “paths” cansomeone take to reach the top?Base cases: 0 -> 0      1 -> 1      2 -> 2 (1,1),(2)      3 -> 4 (1,1,1),(1,2),(2,1),(3)Test Case 1:Enter steps in staircase: 624Test Case 2:Enter steps in staircase: 20121415Sample Test CasesTest Case 1:Expected Output:Enter·steps·in·staircase:·624

You are climbing a staircase. It takes n steps to reach the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Input FormatInput from stdin will be processed as follows and passed to the function.The first line contains an integer n, the number of steps.Constraints0 <= n <= 1000Output FormatThe output is the number of waysSample Input 02Sample Output 02

A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can run up the stairs.Examples: Input : 4Output : 7Explanation:Below are the seven ways 1 step + 1 step + 1 step + 1 step 1 step + 2 step + 1 step 2 step + 1 step + 1 step 1 step + 1 step + 2 step 2 step + 2 step 3 step + 1 step 1 step + 3 stepInput : 3Output : 4Explanation:Below are the four ways 1 step + 1 step + 1 step 1 step + 2 step 2 step + 1 step 3 stepNote : print the answer % 10^9+7Constraint:1 <= N <= 10000

Count ways to reach the nth stair

is currently standing at stair 0 and wants to reach exactly the stair numbered C.The programmer can climb either H steps or 1 step in one move. Find the minimum number of moves required by the programmer to reach exactly the stair C.Input FormatThe first line of input will contain a single integer T, denoting the number of test cases.Each test case consists of a single line of input containing two space separated integers C and H denoting the number of stair the programmer wants to reach and the number of stairs the programmer can climb in one move.Constraints1 <= T <= 5001 <= C, H <= 100Output FormatFor each test case, output the minimum number of moves required by the programmer to reach exactly the stair numbered C.Sample Input 044 28 33 42 1Sample Output 02432Sample Input 13374 30588 71305 309Sample Output 17018305