George and Accommodation

最新推荐文章于 2020-11-29 20:49:38 发布

原创最新推荐文章于 2020-11-29 20:49:38 发布 · 194 阅读

0 ·

CC 4.0 BY-SA版权

本文探讨了BerlandStateUniversityforCoolProgrammers的宿舍分配问题，通过算法计算哪些房间可以容纳新入学的George和Alex共同居住。输入包括房间数量及各房间当前居住人数和容量，输出为可接纳两人的房间数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Input

3
1 10
0 10
10 10

Output

问题链接https://vjudge.net/problem/CodeForces-46

理解题目就行了。

#include <iostream>
using namespace std;

int main()
{
	int x, y, z; int j = 0;
	cin >> x;
	for (auto i = 0; i < x; i++)
	{
		cin >> y >> z;
		if (z-y>1 )j++;
	}
	cout << j;
}