ronith

9/7/2018 - 1:25 PM

A thief trying to escape from a jail has to cross N walls each with varying heights. He climbs X feet every time. But, due to the slippery nature of those walls, every times he slips back by Y feet. Now the task is to calculate the total number of jumps required to cross all walls and escape from the jail.

Input: The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two space separated integers X, Y, N. Then in the next line are N space separated values denoting the heights ( Ht[] ) of the walls.

Output: For each test case in a new line print the total number of jumps.

Constraints: 1<=T<=100 1<= N, X, Y <=100 1<= Ht[] <=1000

Example: Input: 2 10 1 1 5 4 1 5 6 9 11 4 5

Output: 1 12

```
//https://practice.geeksforgeeks.org/problems/thief-try-to-excape/0
#include <iostream>
using namespace std;
void jumps (int a[], int n, int x, int y) {
int j=0;
for (int i=0;i<n;i++) {
if (a[i]<=x) {
j++;
continue;
}
while(a[i]>0) {
a[i]= a[i]-x+y;
j++;
}
}
cout<<j<< "\n";
}
int main() {
int t;
cin>>t;
while (t-->0) {
int x,y,n;
cin>>x>>y>>n;
int a[n];
for (int i=0;i<n;i++)
cin>>a[i];
jumps (a,n,x,y);
}
}
```