George and Accommodation CodeForces - 467A

最新推荐文章于 2021-06-02 16:53:55 发布

原创最新推荐文章于 2021-06-02 16:53:55 发布 · 234 阅读

CC 4.0 BY-SA版权

本文介绍了一个简单的算法，用于解决George和Alex在大学宿舍中寻找可容纳两人的空闲房间的问题。通过输入每个房间的当前居住人数和容量，算法计算并输出满足条件的房间数量。

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

问题地址：添加链接描述

问题简述：
输入宿舍数目，跟宿舍每间房间以后人数和最大可以承载人数，计算George 和 Alex住在一个宿舍里面。

问题分析：
使用整形输入所有数字，然后比较输出。

#include<iostream>
using namespace std;
int main()
{
	int r,a,b,n=0;
	cin >> r;
	for (int i = 0; i < r; i++)
	{
		cin >> a >> b;
				if (b-a>=2)
				n++;
		
	}
	cout << n;
	return 0;
}