CodeForces
来源:互联网 发布:java预防死锁的方法 编辑:程序博客网 时间:2024/06/05 10:50
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.
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.
Print a single integer — the number of rooms where George and Alex can move in.
31 12 23 3
0
31 100 1010 10
2
代码:
#include<cstdio>int main() {int n,ans=0;scanf("%d",&n);for(int i=1;i<=n;i++){int a,b;scanf("%d%d",&a,&b);if(b-a>=2){ans++;}}printf("%d",ans);return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- # JDK安装及环境配置
- 从零开始学Java
- git warning: LF will be replaced by CRLF in xxxxx 解决办法
- 我等的宏观发展来了,国家级AI
- 18-Vue实例的全局配置
- CodeForces
- 大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。 n<=39
- Chrome插件收集
- 循环应用。
- 第八届福建省大学生程序设计竞赛-重现赛(感谢承办方厦门理工学院)
- 留着以后慢慢做的概率DP
- windows上面mysql 5.6 主从同步 replication
- http基础知识
- 设计模式(8)--组合模式