【Codeforces】-#667A- Pouring Rain
2016-05-27 09:10
337 查看
点击打开题目
A. Pouring Rain
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, contemplate all around you, enjoy freshness,
think about big deeds you have to do.
Today everything had changed quietly. You went on the street with a cup contained water, your favorite drink. In a moment when you were drinking a water you noticed that the process became quite long: the cup still contained water because of rain. You decided
to make a formal model of what was happening and to find if it was possible to drink all water in that situation.
Thus, your cup is a cylinder with diameter equals d centimeters. Initial level of water in cup equalsh centimeters
from the bottom.
You drink a water with a speed equals v milliliters per second. But rain goes with such speed that if you do not drink a water from
the cup, the level of water increases on e centimeters per second. The process of drinking water from the cup and the addition of
rain to the cup goes evenly and continuously.
Find the time needed to make the cup empty or find that it will never happen. It is guaranteed that if it is possible to drink all water, it will happen not later than after 104 seconds.
Note one milliliter equals to one cubic centimeter.
Input
The only line of the input contains four integer numbers d, h, v, e (1 ≤ d, h, v, e ≤ 104),
where:
d — the diameter of your cylindrical cup,
h — the initial level of water in the cup,
v — the speed of drinking process from the cup in milliliters per second,
e — the growth of water because of rain if you do not drink from the cup.
Output
If it is impossible to make the cup empty, print "NO" (without quotes).
Otherwise print "YES" (without quotes) in the first line. In the second line print a real number — time in seconds needed the cup will be empty. The answer
will be considered correct if its relative or absolute error doesn't exceed 10 - 4.
It is guaranteed that if the answer exists, it doesn't exceed104.
Examples
input
output
input
output
Note
In the first example the water fills the cup faster than you can drink from it.
In the second example area of the cup's bottom equals to
,
thus we can conclude that you decrease the level of water by
centimeters
per second. At the same time water level increases by 1 centimeter per second due to rain. Thus, cup will be empty in
seconds.
数学题,读懂题目即可,灵活转换两个不同的速度
A. Pouring Rain
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your thoughts in order. By these years you have developed a good tradition — when it rains, you go on the street and stay silent for a moment, contemplate all around you, enjoy freshness,
think about big deeds you have to do.
Today everything had changed quietly. You went on the street with a cup contained water, your favorite drink. In a moment when you were drinking a water you noticed that the process became quite long: the cup still contained water because of rain. You decided
to make a formal model of what was happening and to find if it was possible to drink all water in that situation.
Thus, your cup is a cylinder with diameter equals d centimeters. Initial level of water in cup equalsh centimeters
from the bottom.
You drink a water with a speed equals v milliliters per second. But rain goes with such speed that if you do not drink a water from
the cup, the level of water increases on e centimeters per second. The process of drinking water from the cup and the addition of
rain to the cup goes evenly and continuously.
Find the time needed to make the cup empty or find that it will never happen. It is guaranteed that if it is possible to drink all water, it will happen not later than after 104 seconds.
Note one milliliter equals to one cubic centimeter.
Input
The only line of the input contains four integer numbers d, h, v, e (1 ≤ d, h, v, e ≤ 104),
where:
d — the diameter of your cylindrical cup,
h — the initial level of water in the cup,
v — the speed of drinking process from the cup in milliliters per second,
e — the growth of water because of rain if you do not drink from the cup.
Output
If it is impossible to make the cup empty, print "NO" (without quotes).
Otherwise print "YES" (without quotes) in the first line. In the second line print a real number — time in seconds needed the cup will be empty. The answer
will be considered correct if its relative or absolute error doesn't exceed 10 - 4.
It is guaranteed that if the answer exists, it doesn't exceed104.
Examples
input
1 2 3 100
output
NO
input
1 1 1 1
output
YES 3.659792366325
Note
In the first example the water fills the cup faster than you can drink from it.
In the second example area of the cup's bottom equals to
,
thus we can conclude that you decrease the level of water by
centimeters
per second. At the same time water level increases by 1 centimeter per second due to rain. Thus, cup will be empty in
seconds.
数学题,读懂题目即可,灵活转换两个不同的速度
<span style="font-size:10px;">#include<cstdio> #define PI 3.14159265 int main() { int d,h,v,e; double s,v1,v2,ans; while(~scanf("%d%d%d%d",&d,&h,&v,&e)) { s=d/4.0*d*PI; v1=v/s; //h,和v1都表示水的高度,所以把v1也化成高度一起好计算 v2=e; ans=h/(v1-v2); if(v1<=v2||ans-1e4>1e-4) //喝水不大于雨速和最大时间没完成则... printf("NO\n"); else printf("YES\n%lf\n",ans); } return 0; } </span>
相关文章推荐
- SYN攻击TIME_WAIT防御。
- 【CodeForces】651B - Beautiful Paintings
- Codeforces Round #353 (Div. 2) B. Restoring Painting
- CodeForces667APouring Rain
- LightOJ 1282 Leading and Trailing(取n^k的最高三位数字)
- 2009 Multi-University Training Contest 1 题集(长期更新)
- RAID
- 红头文件吹响全面进军人工智能的战斗号角
- main函数的实现解析
- IPC进程间通信 - AIDL+Binder
- linker command failed with exit code 1 (use -v to see invocation)报错
- 解决open-vm-tools安装时Failed to get unit file state for run-vmblockx2dfuse.mount
- 报错"std::__1::basic_string<char, std::__1::char_traits<char>, std::__1::allocator<char> >::at(unsigne
- 检测是否超出int范围 && 11. Container With Most Water
- scala之trait详解一
- Theano: CNMeM is disabled, CuDNN not available
- X64操作系统组件Jmail无法正常服务问题
- X64操作系统组件Jmail无法正常服务问题
- Crazy Thairs_poj3378_DP+离散+高精度+树状数组
- WM_PAINT