CodeForces667APouring Rain
2016-05-27 07:32
459 查看
Description
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 equals h 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 exceed 104.
Sample Input
Input
Output
Input
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 equals h 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 exceed 104.
Sample Input
Input
1 2 3 100
Output
NO
Input
1 1 1 1
Output
YES 3.659792366325 题意:一个人喝一杯饮料,在他一边喝的同时雨水也在同时灌入(简直不敢想象),给出圆柱形杯的底面直径a,原有饮料的高度b,此人喝饮料的速度c(cm^3/s),以及当此人不喝饮料时雨水灌入升速(cm/s),判断此人能否将瓶中饮料喝完,如果能喝完,算出所用时长。 代码如下:#include<stdio.h> #include<math.h> #define PI acos(0)*2 int main() { double a,b,c,d; while(scanf("%lf%lf%lf%lf",&a,&b,&c,&d)!=EOF) { double r=a/2; double V=PI*r*r*b; double vrain=PI*r*r*d; if(c<vrain) printf("NO\n"); else { double t; t=V/(c-vrain); printf("YES\n%.12lf\n",t); } } }
相关文章推荐
- 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
- int main(int argc,char* argv[])详解
- 如何理解:int main(int argc, char** argv)
- 【CodeForces】675B - Restoring Painting(数学推导)
- 论文笔记之:Fully Convolutional Attention Localization Networks: Efficient Attention Localization for Fine-Grained Recognition