AIM Tech Round (Div. 2) A
2016-02-08 18:05
363 查看
A. Save Luke
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 0 and 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 d, L, v1, v2 (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
![](http://codeforces.com/predownloaded/c6/2e/c62ea64d4651240724c5ac4779b671c741edec24.png)
.
Sample test(s)
Input
Output
Input
Output
Note
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
![](http://codeforces.com/predownloaded/f3/ba/f3ba81b542e72ab562c5ffa6b8de3500771a901e.png)
. In this case both presses move to his edges at the same time
题意:L长 两人分别从0,L点出发以速度v1,v2 当距离小于等于d时停止
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 0 and 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 d, L, v1, v2 (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
![](http://codeforces.com/predownloaded/c6/2e/c62ea64d4651240724c5ac4779b671c741edec24.png)
.
Sample test(s)
Input
2 6 2 2
Output
1.00000000000000000000
Input
1 9 1 2
Output
2.66666666666666650000
Note
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
![](http://codeforces.com/predownloaded/f3/ba/f3ba81b542e72ab562c5ffa6b8de3500771a901e.png)
. In this case both presses move to his edges at the same time
题意:L长 两人分别从0,L点出发以速度v1,v2 当距离小于等于d时停止
#include<bits/stdc++.h> using namespace std; double d,l,v1,v2; int main() { scanf("%lf%lf%lf%lf",&d,&l,&v1,&v2); printf("%lf\n",(l-d)/(v1+v2)); return 0; }
相关文章推荐
- HDU-1023 Train Problem II 出栈序列问题
- hdu1789 Doing Homework again(贪心)
- HDU 1022 Train Problem I
- USACO--Barn Pepair
- LightOJ 1028 1028 - Trailing Zeroes (I) (求因子个数)
- Failed to load native-hadoop本地库不一致的解决办法
- NetworkOnMainThreadException
- Vim简明教程【CoolShell】转自http://blog.csdn.net/niushuai666/article/details/7275406 (飘过的小牛)
- JetBrains Cracker
- tortoisegit 常见错误disconnected no supported authentication methods available(server sent: publickey)
- aircrack-ng套装破解wifi过程详解
- color-scheme,颜色方案,jetbrains主题,webstrom
- 人工智能之一:什么是人工智能?
- #AIM Tech Round [div2] C. Graph and String 【连通图、染色】
- 使用Behavior Designer插件简单制作NPC AI
- Codeforces AIM Tech Round (Div. 2) 624A A. Save Luke
- Codeforces AIM Tech Round (Div. 2) 624B Making a String
- Codeforces AIM Tech Round (Div. 1)623A Graph and String
- Codeforces AIM Tech Round (Div. 2)解题报告
- UVa--10976 Fractions Again(枚举)