poj2017——Speed Limit

原题：

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

Speed in miles perhour Total elapsed time in hours

20 2

30 6

10 7

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

3 20 2 30 6 10 7 2 60 1 30 5 4 15 1 25 2 30 3 10 5 -1

Sample Output

170 miles 180 miles 90 miles

分析：

简单数学

源码：

#include<stdio.h> #define N 100 int 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; }

转载于:https://blog.51cto.com/bingsanchun/1271338

poj2017——Speed Limit相关推荐

2.1.1 Speed Limit
#include <iostream> using namespace std; int main() {int n,i,x,y,z,ans;while(cin>>n& ...
uboot 或者 linux 下限制 sata speed
1.linux下通过 cmdline 实现参考 :Documentation/admin-guide/kernel-parameters.txt libata.force= [LIBATA] Fo ...
Toward a More Complete, Flexible, and Safer Speed Planning for Autonomous Driving via Convex Optimiz
Toward a More Complete, Flexible, and Safer Speed Planning for Autonomous Driving via Convex Optimiz ...
Baidu Apollo代码解析之EM Planner中的QP Speed Optimizer 1
大家好,我已经把CSDN上的博客迁移到了知乎上,欢迎大家在知乎关注我的专栏慢慢悠悠小马车(https://zhuanlan.zhihu.com/duangduangduang).希望大家可以多多交流, ...
ICPC程序设计题解书籍系列之五：吴永辉：《数据结构编程实验》（第2版）
第1章简单计算 UVALive2362 POJ1004 HDU1064 ZOJ1048 Financial Management[数学+水题] - 海岛Blog - CSDN博客 POJ1552 H ...
工厂用抽象类比接口_用简单的现实类比解释硬编码概念
工厂用抽象类比接口 by Samer Buna 通过Samer Buna 用简单的现实类比解释硬编码概念 (Hard Coding Concepts Explained with Simple Rea ...
《自然》：修复AI神经网络的缺陷
来源:王宏琳科学网博客我在上一篇<海外观察>博客中,介绍了纽约大学马库斯教授和戴维斯教授的新书<重启 AI:构建我们可以信任的人工智能>和图灵奖得主朱迪亚•珀尔的著作< ...
Linux_SquidProxyServer代理服务器
目录目录 Squid proxy server Web proxy server operating principle Squid features Setup squid server Setu ...
前端开发工程师如何在新的一年里提升自己
大部分人非常在意个人在技术上的提升.但是保持对新技术的了解是一项不小的挑战, 毕竟我们需要的信息在数量上过于庞大.2012年里,伴随着前端发展的是大量的革命性突破和对前端的重新定义. 我们在实践的路上 ...

poj2017——Speed Limit

poj2017——Speed Limit相关推荐

最新文章

热门文章