周练L - Pouring Rain 【数学】
2016-05-29 20:58
429 查看
L - Pouring Rain
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
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.
![](http://7xjob4.com1.z0.glb.clouddn.com/9f3b25e77166e9d7b9f95b4f5ce07d58)
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
根据题意列数学式 化简就好
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
1 2 3 100
Output
NO
Input
1 1 1 1
Output
YES 3.659792366325
根据题意列数学式 化简就好
#include <iostream> #include <cstdio> #include <cmath> #define PI acos(-1.0) using namespace std; int main() { double d,h,v,e,s,t; while(~scanf("%lf%lf%lf%lf",&d,&h,&v,&e)) { s=PI*(d/2)*(d/2); t=h*s/(v-e*s); if(v<=e*s) printf("NO\n"); else { printf("YES\n"); printf("%.12lf\n",t); } } return 0; }
相关文章推荐
- DX名词解释:SwapChain
- 2015 北京区域赛 Today Is a Rainy Day(暴搜)
- Can brain stimulation aid memory and brain health?
- ZZULIOJ 1426: 字典树again【字典树+bfs】
- 高级I/O-----socketpair
- 高级I/O----sockerpair
- poj-3735-Training little cats-矩阵快速幂
- Syntax error,parameterized types are only available if source level is 5.0
- FZU-2216 The Longest Straight (二分枚举)
- view plain
- 解决TIME_WAIT状态常见的解决办法
- Codeforces Round #320 (Div. 2) [Bayan Thanks-Round]A Raising Bacteria
- HDU 5293 Tree chain problem 树形dp+dfs序+树状数组+LCA
- Convolutional Neural Networks at Constrained Time Cost
- haartraining实践总结
- 重建freescale 4.6.2 multilib toolchain
- LightOJ 1236 Pairs Forming LCM(lcm(i, j) = n的对数)
- HDU1848 Fibonacci again and again(SG函数)
- LightOJ 1282 Leading and Trailing(n^k的高三位和低三位)
- 【一天一道LeetCode】#70. Climbing Stairs