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

Given an integer array A of length N. Where Ai is the cost of stepping on the ith stair.From ith stair, you can go to i+1th or i+2th numbered stair.Initially, you are at 1st stair find the minimum cost to reach Nth stair.Problem Constraints2 <= N <= 1051 <= Ai <= 104Input FormatThe first and only argument is an integer array A.Output FormatReturn an integer.Example InputInput 1:A = [1, 2, 1, 3]Input 2:A = [1, 2, 3, 4]Example OutputOutput 1:5Output 2:7Example ExplanationExplanation 1:1 -> 3 -> 4Explanation 2:1 -> 2 -> 4

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

Stair Case ProblemA 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 stepNote : print the answer % 10^9+7Constraint:1 <= N <= 10000

Minimum Number of Jumps to Reach End Given an array of integers where each element represents the maximum number of steps that can be jumped going forward from that element, write a function to return the minimum number of jumps to reach the end of the array (starting from the first element). If the end is not reachable, return -1.Constraints:NAExample:Sample Input:523114Sample Output:2Explanation:First line of input--> size of array (n)Then n lines of integers.Output--> From the above example ,the number of jumps needed to reach the end of array are 2Public Test Cases:# INPUT EXPECTED OUTPUT1 5231142

Get a 2 input from a user, first one for count of step and 2nd one for direction(only right and left). Find the position after moving by left or right by the specified number of stepsInput Format:Enter an Integer and Character as input.Output Format:Print the output as  two integers in the following format : (x,y)Constraints:-10^15 <= INPUT <= 10^15Sample Input 1:10 LSample Output 1:(-10,0)Sample Input 2:10 RSample Output 2:(10,0)