A. George and Accommodation

A. George and Accommodation

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

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
inputCopy
3
1 1
2 2
3 3
outputCopy
0
inputCopy
3
1 10
0 10
10 10
outputCopy
2

问题链接： A. George and Accommodation

问题简述：

输入学校的个数，和每间学校的入住人数和宿舍位，计算有多少间学校小明和小李可以入住。

问题分析：

注意是小明和小李同时入住，所以要空出至少两个空位。

程序说明：

本程序利用一个新的变量ans记录答案。但是，在使用内存方面还可以改进，至少还可以去掉一个int类型的变量。

AC通过的C语言程序如下：

    #include "stdafx.h"
    #include<iostream>
    using namespace std;
    
    int main()
    {
    	int n, a, b, ans = 0;
    	cin >> n;
    	for (int i = 0; i < n; i++)
    	{
    		cin >> a >> b;
    		if (a < b - 1)ans++;
    	}
    	cout << ans;
    	return 0;
    }