CodeForces - 467A George and Accommodation【水题】

CodeForces - 467A George and Accommodation【水题】

George and Accommodation

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
问题描述：
George和Alex上大学后想找宿舍一起住，宿舍必须能容纳下他们两个人，输入宿舍的个数，看第n个宿舍已经住了多少人，和能住多少人，输出能住下他们两个人的宿舍的个数。

问题分析：
定义一个变量来保存符合条件宿舍的个数，最后输出这个变量。

程序说明：
先输入宿舍的个数，再用循环结构逐个输入已住人数和最大容纳量，用if语句判断是否符合条件，最后输出结果。

AC通过的c++程序如下：

#include <stdio.h> 
using namespace std;
int main()
{
	int i=0;
	int n=0;
	int a=0;
	int b=0;
	int c=0;
	scanf_s("%d\n",&n);
	while(i<n)
	{
		
		scanf_s("%d  %d",&a,&b);
		if (b - a >= 2)
			c++;
		i++;
	}
	printf("%d",c);

}