codeforces467-A水题

2019-11-05 16:00:56来源:博客园 阅读 ()

新老客户大回馈,云服务器低至5折

codeforces467-A水题

题目链接:http://codeforces.com/problemset/problem/467/A

A. George and Accommodation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard 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 input Copy
3
1 1
2 2
3 3
output Copy
0
input Copy
3
1 10
0 10
10 10
output Copy
2
#include<iostream>
using namespace std;

int main()
{
    int n,p,q,num = 0;
    cin >> n;
    while(n--)
    {
        cin >> p >> q;
        if(q - p >= 2)
            num++;
    }
    cout << num << endl;
    return 0;
}

 


原文链接:https://www.cnblogs.com/biaobiao88/p/11801414.html
如有疑问请与原作者联系

标签:

版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有

上一篇:HyperFT项目安卓端的环境搭建及编译的图解教程

下一篇:在C++中调用FFTW