Question

po A man wants to do rock climbing and reach the top of a steep peak. There is 'N' number of convenient rocks on the mountain which the mountaineer can step onto to 33.cach the peak a little easily. The initial position/rock on which the rock climber is standing currently is denoted as T. From each rock, the person can skip utmost X rocks. The task here is to find the number of ways a mountaineer can climb to reach the peak. 3431161_98 Example 1: Input: 6 - Value of N → Value of - Value of x 2131161 98 533431161 98 532431161_98 Output: 3 Number of ways he can reach the peak Explanation: From the inputs given above: 86 1915 Total number of rocks: 6(11, 12, r3, r4, r5, r6). 533 Initial rock number on which the person is currently: 3​

Answer 1

Answer:

Partnership and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family and friends and family