2176Speed Limit(水题)
来源:互联网 发布:域名com和cn的区别 编辑:程序博客网 时间:2024/05/29 08:33
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
Speed in miles per hourTotal 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 integern, 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 fort are always in strictly increasing order. A value of -1 forn signals the end of the input.
Output
For each input set, print the distance driven, followed by a space, followed by the word "miles".
Example input:Example output:320 2
30 6
10 7
2
60 1
30 5
4
15 1
25 2
30 3
10 5
-1170 miles
180 miles
90 miles
Source: Mid-Central USA 2004
××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××
//s=v*t;注意第一次的时间无需减前面的时间
#include<iostream>
using namespace std;
int main()
{
int speed[10],time[10];
int s,i;
int num;
while(cin>>num&&num!=-1)
{
s=0;
for(i=0;i!=num;i++)
cin>>speed[i]>>time[i];
for(i=1;i!=num;i++)
s+=speed[i]*(time[i]-time[i-1]);
s+=speed[0]*time[0];
cout<<s<<" miles"<<endl;
}
return 0;
}
- 2176Speed Limit(水题)
- zoj 2176 Speed Limit
- ZOJ 2176 Speed Limit
- ZOJ 2176 Speed Limit
- zoj 2176 Speed Limit
- 【2017】Speed Limit (水题)POJ
- Poj 2017 Speed Limit(水题)
- Speed Limit - POJ 2017 水题
- Limit Speed
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- ZOJ Problem Set - 2176 Speed Limit
- POJ 2017 Speed Limit(水~)
- POJ 2017 Speed Limit
- Saving HDU+排序+贪心
- 页面跳转的几个小例子
- Jquery submit() 问题
- Mac 使用技巧50个
- Java学习0
- 2176Speed Limit(水题)
- 经典石子合并问题
- C#生成GUID
- 02 Android 自定义对话框
- 美妙的微机原理2013/4/20
- 杭电2017
- hdu2955-Robberies
- MySQL关联left join 条件on与where不同
- 杭电2018