Problem-467A-Codeforces-George and Accommodation

A. George and Accommodation
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
3
1 1
2 2
3 3
output
0
input
3
1 10
0 10
10 10
output
2

#include<stdio.h>
int main(){
    int n;
    scanf("%d",&n);
    int people[n][2];
    int count=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<2;j++){
            scanf("%d",&people[i][j]);
        }
            if(people[i][1]-people[i][0]>=2)
                count++;
    }
    printf("%dn",count);
}

#include <stdio.h>
int main(){
    int n,a,b,count=0;
    scanf("%d",&n);
    while(n--){
        scanf("%d%d",&a,&b);
        if(b-a>=2)count++;
    }
    printf("%dn",count);
}

最后

以上就是冷静咖啡豆为你收集整理的Problem-467A-Codeforces-George and Accommodation的全部内容，希望文章能够帮你解决Problem-467A-Codeforces-George and Accommodation所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。