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
问题简述:输入房间数、已入住人数和可容纳人数,判断每间房间是否还可以入住两人。
问题分析:输入房间数进行循环判定,若(容纳人数-已住人数>=2)即可搬入;
程序说明:定义两个整型数组分别记录每间房间的已入住人数和可容纳人数,利用for循环进行判断,再用k累加记录有多少个房间符合条件。
AC通过的C++语言程序如下:
#include
using namespace std;
int main()
{
int n,p[100],q[100],k=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>p[i]>>q[i];
if(q[i]-p[i]>=2)
k++;
}
cout<<k;
}