acm第二题

Time limit1000 msMemory limit262144 kBSourceCodeforces Round #267 (Div. 2)Tagsimplementation *800EditorialAnnouncement

problem description
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

问题描述：输入宿舍总共有多少间房间，再输入每个房间已住人数和最多可住人数，输出他们两个可以有多少个选择。

问题分析：用直接比较已住人数和最多可住人数的方法，若（已住人数+2）<=最多可住人数。即，这个房间可以选择。

程序说明：程序很简单，没有太复杂的程序

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