（二） P - P Save Luke 【数学】

最新推荐文章于 2023-02-12 10:49:48 发布

阿.荣.

最新推荐文章于 2023-02-12 10:49:48 发布

阅读量353

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/bmicnj/article/details/51553479

版权

数学专栏收录该内容

67 篇文章 0 订阅

订阅专栏

P - P

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Luke Skywalker got locked up in a rubbish shredder between two presses. R2D2 is already working on his rescue, but Luke needs to stay alive as long as possible. For simplicity we will assume that everything happens on a straight line, the presses are initially at coordinates 0and L, and they move towards each other with speed v₁ and v₂, respectively. Luke has width d and is able to choose any position between the presses. Luke dies as soon as the distance between the presses is less than his width. Your task is to determine for how long Luke can stay alive.

Input

The first line of the input contains four integers d, L, v₁, v₂ (1 ≤ d, L, v₁, v₂ ≤ 10 000, d < L) — Luke's width, the initial position of the second press and the speed of the first and second presses, respectively.

Output

Print a single real value — the maximum period of time Luke can stay alive for. Your answer will be considered correct if its absolute or relative error does not exceed 10^- 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if $\text{[math]}$ .

Sample Input

Input

2 6 2 2

Output

1.00000000000000000000

Input

1 9 1 2

Output

2.66666666666666650000

Hint

In the first sample Luke should stay exactly in the middle of the segment, that is at coordinates [2;4], as the presses move with the same speed.

In the second sample he needs to occupy the position $\text{[math]}$ . In this case both presses move to his edges at the same time.

题意：一人的左右有两面墙，分别以v1 v2 的速度向自己移动，自己的伸展空间是d,两墙之间的宽度<d, 这个人就会死，问这人能活多长时间

题解：（l-d）/(v1+v2)

代码：

#include <cstdio>
int main()
{
    double d,l,v1,v2,time;
    while(~scanf("%lf%lf%lf%lf",&d,&l,&v1,&v2))
    {
        l=l-d;
        time=l/(v1+v2);
        printf("%.20lf\n",time);
    }
    return 0;
}