ACM 第一期训练题第2题

题目：

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.
题解：首先定义int类型的n,pi,qi,i,j，以n表示房间数，pi为房间中已住人数，qi为房间中能容纳的人数，j为
可以移动的房间数，初始化为0。首先输入房间数，再用for循环语句输pi和qi的值，用if判断qi-pi是否大于等于2，若是则j+1，最后输出j。

#include <iostream>
using namespace std;
int main()
{
	int n, pi, qi, i, j = 0;
	cin >> n;
	for (i = 2; i <= n + 1; i++)
	{
		cin >> pi >> qi;
		if (qi - pi >= 2)
			j++;
	}
	cout << j << endl;
}