星空 & C O

值得开始的事为甚么不去完成

(二) P - P Save Luke 【数学】

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

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 v1 and v2, 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 dLv1v2 (1 ≤ d, L, v1, v2 ≤ 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 .

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 . 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;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/bmicnj/article/details/51553479
个人分类: 数学
想对作者说点什么? 我来说一句

分词lucene

2014年03月22日 410KB 下载

PRIMES is in P

2009年05月07日 195KB 下载

p、*p和&amp;p

lizhaoheng1982 lizhaoheng1982

2010-06-15 23:46:00

阅读数:1739

*p++, *++p, ++*p, (*p)++

lcg_1010 lcg_1010

2014-09-04 21:59:58

阅读数:375

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭