Timer is Running

The Spider Steps
Submissions: 2648   Accuracy:


  Difficulty: Basic   Marks: 1

A spider present at the bottom of the well of height H, needs to get out of it, using the slippery wall of the well. It decides to climb up the well, it goes up U metres and slips down D metres in one single step. So, in each step it covers (U-D) metres, and if the spider gets out of the well by covering U metres in the last step it doesn't slips back.
For example, if the spider climbs up 5 metres and slips down by 3 meters in a single step, it covers ( U - D ) m in each step and 96 m in 48 steps, but in the 49th step it climbs up 5 m and reaches out of the well and it will not slip down and the step is counted as one step. 

The first line will contain an integer (number of test cases). Each test case will contain 3 integers ’H’ height of the well, next ’U’ metres climbs up in each step, and the last ’D’ metres slips down in each step.

The number of steps 'N' required to get out of the well.

1 < = T < = 1000
50 < = H < = 1000
1  < = D < U < = 50


200 50 1
500 20 15


Length of well = 200
Climbs up to = 50 m at each step
Slips down by = 1m at each step
Step 1 : Climbed up : 50 m
            Slipped down by : 1m
            Distance covered : 49 m
Step 2 : Climed up : 50 m ; reached at 99th m 
             Slipped down by : 1m
             Total distance covered : 98m
Step 3 : Climed up : 50 m ; reached at 148th m 
             Slipped down by : 1m
             Total distance covered : 147 m
Step 4 : Climed up : 50 m ; reached at 197th m 
             Slipped down by : 1m
             Total distance covered : 196m
Step 5 : Climed up : 50 m ; reached out of the well 
             Slipped down by : No slipping as reached 200th m
             Total distance covered : 200


** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Diksha Singhal
Author: diksha1812

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.