-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGeorgeAndAccommodation.cpp
37 lines (27 loc) · 1.17 KB
/
GeorgeAndAccommodation.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
/* 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. */
#include <iostream>
using namespace std;
int main()
{
int rooms, possible;
int students[100], capacity[100];
cin >> rooms;
for(int i = 0; i < rooms; i++){
cin >> students[i] >> capacity[i];
if(capacity[i] - 2 >= students[i]){
possible++;
}
}
cout << possible;
return 0;
}