2018_1_21_Speed Limit_水题
2018-01-21 08:31
295 查看
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
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
Sample Output
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 21088 | Accepted: 14499 |
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 |
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<iostream> #include<string> #include<vector> #include<algorithm> #include<cmath> using namespace std; struct AA{ int a,b; }a[13]; int main(){ int n; while(scanf("%d",&n)){ if(n==-1)return 0; int sum=0; for(int i=1;i<=n;i++) scanf("%d%d",&a[i].a,&a[i].b); for(int i=1;i<=n;i++) sum+=(a[i].b-a[i-1].b)*a[i].a; printf("%d miles\n",sum); } return 0; }
相关文章推荐
- 2176Speed Limit(水题)
- 2018/2/21 面试题刷题第十六天
- LeetCode-21-Merge-Two-Sorted-Lists 递归水题
- 2018_1_21_Gold Coins_模拟
- 2018_1_21_The 3n + 1 problem_简单去做就好_模拟
- 杭电--2018--母牛的故事--水题
- 1/21/2018
- The Number of the Same BST_组合数优化_2018_2_21
- 2018_1_21_Pascal Library_矩阵遍历
- Prufer Code_2018_2_21
- POJ2017 ZOJ2176 UVALive3059 Speed Limit【水题】
- ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) Codeforces932 A. Palindromic Supersequence(水题) B.Recursive Queries(前缀和) C.Permutation Cycle(数学)
- 2018_1_21_Calendar_uva_158__大模拟题
- 【2017】Speed Limit (水题)POJ
- 2018 . 3 . 21 C语言猜数游戏
- 重排序列(水题) - 网易2018校园招聘研发工程师(有道事业部)笔试卷
- Code the Tree_2018_2_21
- 【2017】Speed Limit (水题)POJ
- 【水题+数学推导】杭电 hdu 2018 母牛的故事
- 2018_1_21_MANAGER_简单模拟_poj_1281