VJ第二题题解

CodeForces - 467A

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
问题简述：输入房间数以及房间人数和房间容量，输出可入住房间数。
问题分析：每间房间有两个变量，运用struct定义房间，通过比较房间余量决定可否入住。
程序说明：运用if类型判断是否可以入住，然后变量记录。

#include <iostream>
using namespace std;

struct room
{
	int pi;
	int qi;
};
int main()
{
	int n, k = 0;
	cin >> n;
	 room a[100];
	 for (int i = 0; i < n; ++i)
	 {
		 cin >> a[i].pi >> a[i].qi;
		 if (a[i].qi - a[i].pi >= 2)
			 k++;
	 }
	 cout << k;
	 return 0;
}