George and Accommodation
Time limit 1000 ms
Memory limit 262144 kB
Source Codeforces Round #267 (Div. 2)
Tag simplementation *800
Editorial Announcement
Problem Description
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
Input
3
1 1
2 2
3 3
Output
0
Input
3
1 10
0 10
10 10
Output
2
问题链接:https://vjudge.net/problem/53354/origin
问题简述:根据每个房间的容量大小以及入住人数,计算出有多少个可供两个人同时入住的房间
问题分析:以容量减去入住量
#include <iostream>
using namespace std;
int main()
{
int n, sum=0;
int p[100];
int q[100];
cin >> n;
for(int i=0;i<n;i++)
cin >> p[i] >> q[i];
for (int i = 0; i < n; i++)
{
if (q[i] - p[i] >= 2)
sum++;
}
cout << sum;
}