CodeForces-467A-George and Accommodation

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/CodeForces-467A

题目大概意思是：George和他的朋友 Alex需要住同一个房间，输入房间数n，每个房间最多能住多少人，已住多少人，求出能让他们一起住的房间数，也就是还有多少个房间有2个床以上的空位。

我的思路：定义一个二维数组，依次输入所需数据，若空位少于2的也就是不能住的，则n-1，最后循环后，剩下的就是可以住的了。

代码如下：

#include <iostream>
using namespace std;

int main()
{
	int n, i,c;
	cin >> n;
	c = n;
	int a[100][2];
	for (i = 0; i < c; i++)
	{
		cin >> a[i][0] >> a[i][1];
		if ((a[i][1] - a[i][0]) < 2)n = n - 1;
	}
	cout << n;
}