poj2017——Speed Limit
来源:互联网 发布:mac 邮箱软件 编辑:程序博客网 时间:2024/06/05 08:28
原题:
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
分析:
简单数学
源码:
#include<stdio.h>#define N 100int main(){ int k; int a[N],b[N]; b[0]=0; while(scanf("%d",&k)&&(k!=-1)) { int s=0; for(int i=1; i<k+1; i++) { scanf("%d%d",&a[i],&b[i]); s+=(b[i]-b[i-1])*a[i]; } printf("%d miles\n",s); } return 0;}
- poj2017——Speed Limit
- poj2017 speed limit
- poj2017--Speed Limit
- POJ2017 Speed Limit
- poj2017 Speed Limit
- poj2017 Speed Limit
- poj2017 Speed Limit
- Limit Speed
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- Speed Limit
- poj2017
- poj2017
- poj2017
- POJ2017
- repo 的用法
- sicp 习题2.27
- 我的Android笔记(六)——分享一个自己的NumberPicker
- hdu1703
- Android逆向分析必备网址大全
- poj2017——Speed Limit
- vim配置
- Mysql 优化详细介绍
- Android优秀开源项目大全
- ENVI/IDL——获取AVIRIS数据波段值和经纬度
- VMDK之动态扩展文件解析思路
- 变量‘std::istringstream stream’有初始值设定,但是类型不完全
- mysql 数据库中 的 primary key and key and index
- mac下获取文件的完整路径