Description
Many graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus - Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to school. Due to the bad traffic in Beijing, many students choose to ride a bike.
We may assume that all the students except “Charley” ride from Wanliu to Yanyuan at a fixed speed. Charley is a student with a different riding habit - he always tries to follow another rider to avoid riding alone. When Charley gets to the gate of Wanliu, he will look for someone who is setting off to Yanyuan. If he finds someone, he will follow that rider, or if not, he will wait for someone to follow. On the way from Wanliu to Yanyuan, at any time if a faster student surpassed Charley, he will leave the rider he is following and speed up to follow the faster one.
We assume the time that Charley gets to the gate of Wanliu is zero. Given the set off time and speed of the other students, your task is to give the time when Charley arrives at Yanyuan.
Input
There are several test cases. The first line of each case is N (1 <= N <= 10000) representing the number of riders (excluding Charley). N = 0 ends the input. The following N lines are information of N different riders, in such format:
Vi [TAB] Ti
Vi is a positive integer <= 40, indicating the speed of the i-th rider (kph, kilometers per hour). Ti is the set off time of the i-th rider, which is an integer and counted in seconds. In any case it is assured that there always exists a nonnegative Ti.
Output
Output one line for each case: the arrival time of Charley. Round up (ceiling) the value when dealing with a fraction.
Sample Input
4
20 0
25 -155
27 190
30 240
2
21 0
22 34
0
Sample Output
780
771
此题说北大某同学一定要跟着一个人才能骑车去另一个校区,当Ti是负数代表先走的同学,是正数时代表是后走的同学,因为同学的速度肯定是大于等于跟着的那个前面的同学,所以只要得出比他后出行的那些同学的到达时间最短的那个值就是题解。注意那个ceiling知识点:
C语言数学函数math.h) :ceil(), floor(), round()
double ceil(double x);
double floor(double x);
double round(double x);
ceil(x)返回不小于x的最小整数值(然后转换为double型)。
floor(x)返回不大于x的最大整数值。
round(x)返回x的四舍五入整数值。
#include<stdio.h>
#include<math.h>
int main()
{
int n, Vi, Ti;
double time, mintime;
while(scanf("%d", &n)!=EOF && n!=0)
{
mintime=100000000;
while(n--)
{
scanf("%d %d",&Vi, &Ti);
time=4.5/Vi*3600 + Ti;
if(time<mintime && Ti>=0)
{
mintime=time;
}
}
printf("%d\n", (int)ceil(mintime));
}
return 0;
}