The buses

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 2273
64-bit integer IO format: %I64d      Java class name: Main

Description

Garfield applied for a good job recently, and he will go to work soon by car or bus. Garfield is very broody, sometimes when he sits on the bus to wait for the traffic light, he thinks about how long all the buses pass the traffic turning.
  Now we describe the situations when the buses stop at the traffic turning to wait for the traffic light. First the light is red, then when the light changes to green, all the buses are prepared to move. And at the beginning, all the buses are close to each other without any space, and they have different lengths and the largest speeds. We assume any car can reach the speed that isn’t beyond the maximal speed at once.
  Now Garfield wants you to calculate minimal time all the buses pass the turning.

Input

There are many cases. For each case, there is two intergers N(1<=N<=100), representing the number of the buses. There are two interges in the following N lines, for the length Li(meter, 1<=Li<=10) and the maximal speed Si(meter/second, 1<=Si<=10) of the i-th bus.

Output

For each case, print the result obtaining two digits after the decimal point.

Sample Input

2
1 2
2 3

Sample Output

1.50

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .