满足条件的房间统计

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

问题简述

George和Alex想住在酒店的同一间房间。该酒店有一共有n(1<=n<=100)间房间,第i间房可以容纳qi个人,现在住了pi个人。现在要计算出有多少间房间可以让两个人一起住。

输入要求:第一行是房间的总数n;

第二行是第i间房可以容纳的总数qi和已经入住的人数pi;

每次输入三组数据,然后计算。

一开始将1<=n<=100作为while语句的循环条件,后来发现问题并不是这个意思。

问题分析和程序说明

依次输入多个房间,所以要在一开始用while语句来实现该循环。要输出一共有多少个房间满足条件则另外设定判断语句i<n,并再次设定一个条件qi-pi>=2,定义一个整型a来累加次数。

 

 

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值