For this Question: Aarav is standing at location X and Reena is standing at location Y. In one step Aarav can increase or decrease his location by at most A. What is the minimum no. of steps required by Aarav to reach Reena?The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of three integers X, Y, and A, the initial coordinate of Aarav, the initial coordinate of Reena and the maximum number of coordinates Aarav can move in one step.

<b>Constraints</b>
1 &le; T &le;1000
1 &le; X, Y &le; 100
1 &le; A &le; 100For each test case, output the minimum number of steps required by Aarav to reach Reena.<b>Sample Input</b>
4
10 20 3
36 36 5
50 4 100
30 4 2
<b>Sample Output</b>
4
0
1
13
<b>Explanation</b>
Test case 1: Here Aarav is at point 10 and Reena at psoint 20 so after waling one step Aarav will reach coordinate 13 similarly after 3 steps Aarav location will be 18. Now 3 steps Aarav have walked and only 2 steps way he is from Reena so one more step is needed of length 2. i.e. making a total of 4 steps.
Test case 2: Aarav and Reena are already at the same point., I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

int main() {
    int qw;
    cin >> qw;
    while (qw--) {
        int p, q, cv;
        cin >> p >> q >> cv;
        int diff = abs(p - q);
        int ans = (diff % cv) ? (diff / cv + 1) : diff / cv;
        cout << ans << endl;
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?