• [1258] Large Wave of Leadership

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • As we all know,a large wave of leadership were approaching these days.Now,-10 wants to calculate the time that N leadership's cars pass through gate should be takes.
    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 leadership's car can reach the speed that isn’t beyond the maximal speed at once.And the distance of two leaderships is fixed,of course,the distance will not change when they passes.
    Now -10 wants you to calculate minimal time all the leaderships pass successively(依次).

  • 输入
  • There are many cases. For each case, there is two intergers N(1<=N<=100), representing the number of the leaderships. There are two interges in the following N lines, for the length of leadership' s car Li(meter, 1<=Li<=100) and the maximal speed Vi(meter/second, 1<=V<=100) of the i-th leadership's car.
  • 输出
  • For each case, print the result obtaining two digits after the decimal point.
  • 样例输入
  • 3
    1 4
    2 3
    5 3
  • 样例输出
  • 2.67
  • 提示
  • 来源
  • Minary
  • 操作