acm2:George and Accommodation

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
3
1 1
2 2
3 3
Output
0
Input
3
1 10
0 10
10 10
Output
2
问题链接
https://vjudge.net/problem/CodeForces-467A
问题简述
通过输入的房间数和各个房间(0<n<=100)现住人数§,以及容量(q),来确定George 的选择有多少
C++编码
#include “pch.h”
#include
using namespace std;
int main()
{
int n, p, q,i,k=0;
cout << "请输入房间总数= ";
cin >> n;
for(i=0;i<n;i++)//用for循环输入判断
{
cout << “请输入第” << i + 1 << “个房间所住的人数和容量为=”;
cin >> p >> q;
if (q - p >= 2)//符合就加一
k++;
}
cout << “可供George选择的房间数为”;
cout << k;
}
运行结果
在这里插入图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值