CodeForces 667A Pouring Rain
来源:互联网 发布:非农数据分析 编辑:程序博客网 时间:2024/05/16 10:13
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.
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.
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.
1 2 3 100
NO
1 1 1 1
YES3.659792366325
#include <iostream>#include <string.h>#include <stdlib.h>#include <algorithm>#include <math.h>#include <stdio.h>using namespace std;double d,h,v,e;int main(){ scanf("%lf%lf%lf%lf",&d,&h,&v,&e); double pi=2*asin(1.0); double ve=pi*(d/2)*(d/2)*e; double v1=pi*(d/2)*(d/2)*h; if(v<=ve) {printf("NO\n");return 0;} else { printf("YES\n"); printf("%lf\n",v1/(v-ve)); return 0; }}
- CodeForces 667A Pouring Rain
- CodeForces 667A Pouring Rain
- 【Codeforces】-#667A- Pouring Rain
- 【CodeForces】A. Pouring Rain
- codeforces 667A A. Pouring Rain(水题)
- 【CodeForces】667A - Pouring Rain(数学)
- 【CodeForces】[667]Pouring Rain
- Codeforces 667A Pouring Rain 667B Coat of Anticubism
- CodeForces - 667A Pouring Rain (数学模拟)水
- CodeForces 667A Pouring Rain(喝水问题)
- Codeforces Round #349 (Div. 2)-A. Pouring Rain(数学)
- Pouring Rain
- CodeForces 667APouring Rain
- 周练L - Pouring Rain 【数学】
- Pouring water
- Loneliness is like a rain
- CodeForces - 667A
- RAIN!!!
- 读取zookeeper保存的topic元数据
- android 保存网络图片到本地
- 浅谈Java反射
- Spark Streaming 新手指南(原始文章已经发布表在IBM Developworks)
- sentinel监控主从服务器
- CodeForces 667A Pouring Rain
- C# Queue源码剖析
- HDU1501zipper
- Property’s synthesized getter follows Cocoa naming
- CodeForces 668B Little Artem and Dance
- zookeeper原理(转)
- hrbust/哈理工oj 2220 强迫症【思维】
- c++ auto_ptrs
- fatal error: wiring.h: No such file or directory