(简单模拟2.1.1)POJ 2017 Speed Limit(跨项累加sumLen += (t2-t1)*v )
2013-10-24 15:34
246 查看
/* * POJ_2017.cpp * * Created on: 2013年10月24日 * Author: Administrator */ #include <iostream> #include <cstdio> using namespace std; int main() { int n; while (scanf("%d", &n) != EOF, n != -1) { int t1 = 0, t2 = 0, v = 0; int sumLen = 0; int i; for (i = 0; i < n; ++i) { t1 = t2; scanf("%d%d", &v, &t2); sumLen += (t2 - t1) * v; } printf("%d miles\n",sumLen); } return 0; }
相关文章推荐
- POJ 2017 Speed Limit (直叙式的简单模拟 编程题目 动态属性很少,难度小)
- POJ 2017 Speed Limit 简单模拟
- poj 2017 Speed Limit -- 模拟
- poj 1552 Doubles(简单的模拟一下)
- poj 2017 Speed Limit
- POJ1318 Word Amalgamation 简单模拟
- Distance on Chessboard POJ - 1657 简单模拟
- POJ3087 Shuffle'm Up 简单模拟
- POJ 3989 A hard Aoshu Problem 简单模拟
- POJ-3983-快算24(简单模拟)
- POJ 1028(简单的模拟浏览器)
- POJ 3652 Persistent Bits 简单字符串模拟
- 17 - 01 - 08 POJ 2060 (简单模拟)
- [NOIP2017模拟][poj1091]跳蚤
- POJ 2017 Speed Limit
- [NOIp2017 Day1 T2] 时间复杂度complexity(栈,模拟)
- POJ 2017 Speed Limit
- poj 1218&&hdu 1337 The Drunk Jailer【简单模拟】
- POJ 1886简单模拟
- POJ 3414 Pots(简单模拟+dfs)