关闭

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

191人阅读 评论(0) 收藏 举报
分类:
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;
}


0
0
查看评论

数学排列组合算法 P(N,M) C(N,M)

yeah,组合的也出来了,再一起发一个 using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace ConsoleApplication32{ class Pr...
  • wzp144650
  • wzp144650
  • 2010-02-04 12:35
  • 6055

Codeforces 624A Save Luke 【数学】

A. Save Luke time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Luke Skywalker go...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2016-02-13 18:19
  • 483

CodeForces 624A Save Luke

P - P Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u Sub...
  • yao1373446012
  • yao1373446012
  • 2016-05-30 13:08
  • 222

AIM Tech Round (Div. 2)-A. Save Luke(数学题)

A. Save Luke time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output ...
  • zsc2014030403015
  • zsc2014030403015
  • 2016-02-05 12:55
  • 178

数学排列算法---P(N,M)

昨天写了一个排列算法,不过是P(N,N)的情况,今天把它写完整了,P(N,R)using System;using System.Collections.Generic;using System.Linq;using System.Text;namespace ConsoleApplication3...
  • wzp144650
  • wzp144650
  • 2010-02-04 11:08
  • 763

Codeforces AIM Tech Round (Div. 2) A. Save Luke

A. Save Luke time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Luke Sk...
  • helloiamclh
  • helloiamclh
  • 2016-02-05 11:47
  • 231

Save Luke

 Save Luke Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB     64b...
  • qq_34681949
  • qq_34681949
  • 2016-06-17 13:50
  • 117

数学概念的提出(一) —— 熵的定义式 H(x)=-log2(p(x))

h(x)=−log2p(x) 考虑一个离散型随机变量 xx,当我们观测到该变量的一个特定值,问此时我们通过该值获得的关于该变量的信息量是多少? 信息量可视为“意外的程度”(degree of surprise)关于对该随机变量 xx 的掌握; 如果该事件发生了,而我们事先被告知,该事件极不可能(h...
  • lanchunhui
  • lanchunhui
  • 2016-12-07 22:19
  • 540

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

void test3() { int a[2] = {0}; int *p; p = &a[0]; /* 测试项目: *p++ 运算结果:1 2 指针运动:p移动,指向a[1] */ #if 0 //等同于*(p++) = 1; *p++ = 1; // a...
  • kelsel
  • kelsel
  • 2016-01-09 21:42
  • 286

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

#include int main(void) { int a[5]={1,3,5,7,9}; int *p = a; //*p++ cout<<*p++<<endl; //先取指针p指向的值(数组第一个元素1),再将指针p自增1; //1...
  • honghui91
  • honghui91
  • 2014-07-28 09:52
  • 183
    个人资料
    • 访问:86883次
    • 积分:4889
    • 等级:
    • 排名:第6915名
    • 原创:416篇
    • 转载:17篇
    • 译文:2篇
    • 评论:0条