博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
第二题
阅读量:20602 次
发布时间:2019-12-03

本文共 1126 字,大约阅读时间需要 3 分钟。

George and Accommodation CodeForces - 467A

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.
问题简述:输入要测试多少个数据,然后就给出多少组数据,然后看数据符不符合题目要求
问题分析:……
程序说明:输入房间数,对每组输入的数据判断,输出符合条件的数据的组数
AC程序代码
#include
using namespace std;
int main()
{
int num, a[210],can=0;
cin >> num;
for (int i = 0;num*2!=i;i += 2)
{
cin >> a[i] >> a[i + 1];
if (a[i + 1] - a[i] >= 2)
can++;
}
cout << can << endl;
}

转载地址:http://lgevfk.baihongyu.com/

你可能感兴趣的文章
怎样做情感分析
查看>>
用深度神经网络处理NER命名实体识别问题
查看>>
用 RNN 训练语言模型生成文本
查看>>
RNN与机器翻译
查看>>
用 Recursive Neural Networks 得到分析树
查看>>
RNN的高级应用
查看>>
TensorFlow-7-TensorBoard Embedding可视化
查看>>
轻松看懂机器学习十大常用算法
查看>>
一个框架解决几乎所有机器学习问题
查看>>
特征工程怎么做
查看>>
机器学习算法应用中常用技巧-1
查看>>
机器学习算法应用中常用技巧-2
查看>>
通过一个kaggle实例学习解决机器学习问题
查看>>
决策树的python实现
查看>>
Sklearn 快速入门
查看>>
了解 Sklearn 的数据集
查看>>
用ARIMA模型做需求预测
查看>>
推荐系统
查看>>
TensorFlow-11-策略网络
查看>>
浅谈 GBDT
查看>>