POJ 2017 Speed Limit
来源:互联网 发布:linux 搜索文件夹 编辑:程序博客网 时间:2024/05/05 08:41
Speed Limit
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17160 Accepted: 12061
Description
Bill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how many miles they have driven. Fortunately, Bill has a working stopwatch, so they can record their speed and the total time they have driven. Unfortunately, their record keeping strategy is a little odd, so they need help computing the total distance driven. You are to write a program to do this computation.
For example, if their log shows
this means they drove 2 hours at 20 miles per hour, then 6-2=4 hours at 30 miles per hour, then 7-6=1 hour at 10 miles per hour. The distance driven is then (2)(20) + (4)(30) + (1)(10) = 40 + 120 + 10 = 170 miles. Note that the total elapsed time is always since the beginning of the trip, not since the previous entry in their log.
For example, if their log shows
Speed in miles perhourTotal elapsed time in hours202306107
this means they drove 2 hours at 20 miles per hour, then 6-2=4 hours at 30 miles per hour, then 7-6=1 hour at 10 miles per hour. The distance driven is then (2)(20) + (4)(30) + (1)(10) = 40 + 120 + 10 = 170 miles. Note that the total elapsed time is always since the beginning of the trip, not since the previous entry in their log.
Input
The input consists of one or more data sets. Each set starts with a line containing an integer n, 1 <= n <= 10, followed by n pairs of values, one pair per line. The first value in a pair, s, is the speed in miles per hour and the second value, t, is the total elapsed time. Both s and t are integers, 1 <= s <= 90 and 1 <= t <= 12. The values for t are always in strictly increasing order. A value of -1 for n signals the end of the input.
Output
For each input set, print the distance driven, followed by a space, followed by the word "miles"
Sample Input
320 230 610 7260 130 5415 125 230 310 5-1
Sample Output
170 miles180 miles90 miles
Source
Mid-Central USA 2004
题目大意:
计算总的驾驶距离。
计算方法
Speed in miles perhourTotal elapsed time in hours202306107距离=20*2+30*(6-2)+10*(7-6);#include <iostream>using namespace std;int main(){int n;while(cin>>n&&n!=-1){int i,a[11]={0},b[11]={0};int sum=0;for(i=1;i<=n;i++) { cin>>a[i]>>b[i];sum=sum+a[i]*(b[i]-b[i-1]); }cout<<sum<<" miles"<<endl;}return 0;}
0 0
- POJ 2017 Speed Limit
- POJ 2017 Speed Limit
- poj 2017 Speed Limit
- POJ 2017 Speed Limit
- poj 2017 Speed Limit
- POJ 2017 - Speed Limit
- POJ 2017 Speed Limit
- POJ 2017 Speed Limit
- [POJ] 2017 -> Speed Limit
- poj 2017 Speed Limit
- Speed Limit POJ 2017
- POJ 2017:Speed Limit
- Poj 2017 Speed Limit(水题)
- Speed Limit - POJ 2017 水题
- [ACM] poj 2017 Speed Limit
- poj 2017 Speed Limit -- 模拟
- POJ 2017 Speed Limit G++
- POJ 2017 Speed Limit解题报告
- js表单验证大全
- 深入理解 Java中的 流 (Stream)
- android的屏幕适配
- java中Json解析
- hdu-oj 1335 Basically Speaking
- POJ 2017 Speed Limit
- 高手速成android开源项目【导航篇】
- testmycode
- 【leetcode系列】Valid Parentheses
- 基础代码--显示触摸屏幕的第一个手指的接触前后位置
- 変参函数的实现机制
- 一个比较精确的“在线用户列表”统计功能
- ASP.NET MVC下的四种验证编程方式
- IIS上配置虚拟目录指向局域网共享文件夹