POJ-1922 Ride to School
来源:互联网 发布:燕十八的php讲的怎么样 编辑:程序博客网 时间:2024/06/01 07:39
Ride to School
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20162 Accepted: 8138
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.
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.
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
420025-1552719030240221022340
Sample Output
780771
Source
Beijing 2004 Preliminary@POJ
#include<iostream>#include<math.h>using namespace std;int main(){ int n,i; double v,t,x,min; while(cin>>n&&n!=0) { min=1e100; for(i=0; i<n; ++i) { cin>>v>>t; x=t+(4.5*3600/v); if(x<min&&t>=0) min=x; } cout<<ceil(min)<<endl; } return 0;}
0 0
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- poj 1922 Ride to School
- poj 1922 Ride to School
- POJ 1922 Ride to School
- POJ:1922 Ride to School
- POJ 1922 - Ride to School
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- POJ-1922 Ride to School
- POJ 1922 Ride to School 解题报告
- Ride to School(POJ 1922)
- Ride to School - POJ 1922 水题
- POJ 1922:Ride to School:水题练java
- POJ 1922 Ride to School 简单模拟
- POJ——1922 Ride to School
- POJ 1922:Ride to School 【水】
- iOS开发-Day20-OC 手动内存管理
- 应用程序创建DMG打包发布
- [LeetCode]Reverse Linked List
- 使用xib封装一个自定义view的步骤
- POJ 2013 Symmetric Order 水
- POJ-1922 Ride to School
- 数值的交换
- 第13章:状态开关按钮(ToggleButton)和开关(Switch)的功能和用法
- POJ 2109 Power of Cryptography
- 神经元模型
- POJ-2000 Gold Coins
- MVVM(Model-View-ViewModel)框架——avalon。
- Caffe学习:Forward and Backward
- latex笔记