-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1872A - Two Vessels.cpp
50 lines (44 loc) · 973 Bytes
/
1872A - Two Vessels.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
// ॐ नमः शिवाय
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
// Code Written By: Vikash Patel
// Codeforces Profile: https://codeforces.com/profile/vikashpatel
int solve(int a, int b, int c)
{
if(a == b)
return 0;
int mini = min(a, b);
int maxi = max(a, b);
double d = maxi - mini;
if(d <= c)
return 1;
double part = d/2;
double ans = part/c;
if(ans == (int)ans)
return ans;
return ans+1;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("/Users/vikash/Desktop/output.txt", "w", stdout);
// #endif
int t;
cin>>t;
while(t--)
{
int a, b, c;
cin>>a>>b>>c;
cout<<solve(a, b, c)<<endl;
}
return 0;
}