George and Accommodation

最新推荐文章于 2020-11-29 20:49:38 发布

jessy!

最新推荐文章于 2020-11-29 20:49:38 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_43964923/article/details/84873307

本文探讨了BerlandStateUniversityforCoolProgrammers的宿舍分配问题，重点在于如何找到可以容纳两个新生George和Alex的空余房间。通过遍历每个房间的当前居住人数和容量，判断是否有足够的空间供两人入住。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题解分析：
这题需要注意的是那两个人要住在同一个房间，所以要q-p>=2，这点粗心的话可能会看漏

#include <stdio.h>
#include <stdlib.h>
int main()
{
    int n,p,q,i;
    while(scanf("%d",&n)!=EOF)
    {   int k=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d %d",&p,&q);
            if((q-p)>=2)
                k++;
        }
        printf("%d",k);

    }
    return 0;
}