-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path467A - George and Accommodation.cpp
56 lines (40 loc) · 1.17 KB
/
467A - George and Accommodation.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
51
52
53
54
55
56
/*
George has recently entered the BSUCP (Berland State University for Cool Programmers). George has a friend Alex who has also entered the university. Now they are moving into a dormitory.
George and Alex want to live in the same room. The dormitory has n rooms in total. At the moment the i-th room has pi people living in it and the room can accommodate qi people in total (pi?=?qi). Your task is to count how many rooms has free place for both George and Alex.
Input
The first line contains a single integer n (1?=?n?=?100) — the number of rooms.
The i-th of the next n lines contains two integers pi and qi (0?=?pi?=?qi?=?100) — the number of people who already live in the i-th room and the room's capacity.
Output
Print a single integer — the number of rooms where George and Alex can move in.
Examples
inputCopy
3
1 1
2 2
3 3
outputCopy
0
inputCopy
3
1 10
0 10
10 10
outputCopy
2
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int res = 0;
while (n--) {
int p, q;
cin >> p >> q;
if (q - p >= 2) res++;
}
cout << res;
return 0;
}