本邮件内容由第三方提供，如果您不想继续收到该邮件，可 点此退订 。
POJ2017 Speed Limit - oimonster 阅读原文»
20 2
30 6
10 7
2
60 1
30 5
4
15 1
25 2
30 3
10 5
-1
180 miles
90 miles 
水题，用一个变量存一下上一个时间即可。
Speed Limit
| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 17698 | Accepted: 12433 |
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 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
320 2
30 6
10 7
2
60 1
30 5
4
15 1
25 2
30 3
10 5
-1
Sample Output
170 miles180 miles
90 miles
Source
1 //oimonster
2 #include<cstdio>
3 #include<cstdlib>
4 #include<iostream>
5 using namespace std;
6 int main(){
7 int i,j,n,s,a,b,c;
8 scanf("%d",&n);
9 while(n!=-1){
10 s=0;
11 c=0;
12 for(i=1;i<=n;i++){
13 scanf("%d%d",&a,&b);
14 s=s+a*(b-c);
15 c=b;
16 }
17 printf("%d miles\n",s);
18 scanf("%d",&n);
19 }
20 return 0;
21 }
2 #include<cstdio>
3 #include<cstdlib>
4 #include<iostream>
5 using namespace std;
6 int main(){
7 int i,j,n,s,a,b,c;
8 scanf("%d",&n);
9 while(n!=-1){
10 s=0;
11 c=0;
12 for(i=1;i<=n;i++){
13 scanf("%d%d",&a,&b);
14 s=s+a*(b-c);
15 c=b;
16 }
17 printf("%d miles\n",s);
18 scanf("%d",&n);
19 }
20 return 0;
21 }
本文链接：POJ2017 Speed Limit，转载请注明。
没有评论:
发表评论