-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1692_Marathon.cpp
More file actions
55 lines (45 loc) · 2.06 KB
/
Copy path1692_Marathon.cpp
File metadata and controls
55 lines (45 loc) · 2.06 KB
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
51
52
53
54
55
/* A. Marathon
time limit per test 1 second
memory limit per test 256 megabytes
You are given four distinct integers a, b, c, d.
Timur and three other people are running a marathon.
The value a is the distance that Timur has run and b, c, d correspond to the distances the other three participants ran.
Output the number of participants in front of Timur.
Input
The first line contains a single integer t (1≤t≤104) — the number of test cases.
The description of each test case consists of four distinct integers a, b, c, d (0≤a,b,c,d≤104).
Output
For each test case, output a single integer — the number of participants in front of Timur.
Example
Input:
4
2 3 4 1
10000 0 1 2
500 600 400 300
0 9999 10000 9998
Output:
2
0
1
3
Note
For the first test case, there are 2 people in front of Timur, specifically the participants who ran distances of 3 and 4.
The other participant is not in front of Timur because he ran a shorter distance than Timur.
For the second test case, no one is in front of Timur, since he ran a distance of 10000 while all others ran a distance of 0, 1, and 2 respectively.
For the third test case, only the second person is in front of Timur, who ran a total distance of 600 while Timur ran a distance of 500
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
int count = (b > a) + (c > a) + (d > a);
cout << count << endl;
}
return 0;
}