CodeForces 624A Save Luke
2016-05-30 13:08
363 查看
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 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
.
Sample Input
Input
Output
Input
Output
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.
两堵墙分别相距l ,相对而行。速度分别为v1,v2,当它们之间的距离大于d时安全,问安全的时间。
小学生的数学题目。。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
double d,l,v1,v2;
while(scanf("%lf%lf%lf%lf",&d,&l,&v1,&v2)!=EOF)
{
l=l-d;
printf("%.20lf\n",l/(v1+v2));
}
return 0;
}
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 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
.
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.
两堵墙分别相距l ,相对而行。速度分别为v1,v2,当它们之间的距离大于d时安全,问安全的时间。
小学生的数学题目。。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
double d,l,v1,v2;
while(scanf("%lf%lf%lf%lf",&d,&l,&v1,&v2)!=EOF)
{
l=l-d;
printf("%.20lf\n",l/(v1+v2));
}
return 0;
}
相关文章推荐
- 用ABAP实现SM36的设置后台JOB
- 尼玛,Timer也会休眠啊。
- ubuntu 15.04开放mysql远程3306端口
- 编程需要知道多少数学知识?
- 解决 CodeIgniter 框架应用中,出现Disallowed Key Characters错误提示的方法
- Java的内存思维
- rsync --exclude 参数
- 安卓日记——手把手教你做知乎日报
- ValidateRequest="false"
- 用java数组实现栈
- 为什么寄存器比内存快?
- powerdesigner-从excel导入table模型
- openstack setup demo Enviroment
- hadoop文件合并
- 第十三周项目2-动物这样叫(3)
- MySql事务隔离级别
- gmail邮箱怎么批量删除邮件
- ACM 数据结构-并查集 HDU 1213 How Many Tables
- UVA 10739 [classical dp]
- me软件记录