codeforces 667A A. Pouring Rain(水题)

原创 2016年05月30日 18:37:24


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.

Sample Input

1 2 3 100
1 1 1 1



#include<stdio.h> #include<math.h> #define PI 3.1415926 ||const double PI=acos(-1.0); int main() { double d,h,v,e,t; while(~scanf("%lf%lf%lf%lf",&d,&h,&v,&e)) {   if(PI*d*d*e/4>=v)   printf("NO\n");   else   {   printf("YES\n");   t=PI*d*d*h/4/(v-PI*d*d*e/4);   printf("%.12lf\n",t);   } } return 0;  } 



CodeForces - 667A Pouring Rain(数学,规律)

题目: A. Pouring Rain time limit per test1 second memory limit per test256 megabytes inputstandar...

CodeForces 667A Pouring Rain

Pouring Rain

【CodeForces】A. Pouring Rain

Problem hereProblemA lot of people in Berland hates rain, but you do not. Rain pacifies, puts your t...

Pouring Rain

Description A lot of people in Berland hates rain, but you do not. Rain pacifies, puts your tho...

Codeforces 667D World Tour【最短路+思维】好题!

D. World Tour time limit per test 5 seconds memory limit per test 512 megabytes input st...

【16.67%】【codeforces 667C】Reberland Linguistics

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard...

Codeforces 667C Reberland Linguistics (DP)


Codeforces 667D World Tour (最短路+枚举)

题意另dis[u][v]表示u到v的最短路,求最长的dis[i][j]+dis[j][k]+dis[k][l],输出i, j, k, l。思路先n*nlogn预处理出来所有点的最短路,然后给所有的di...

Codeforces667c dp

Problem:记忆化搜索 题意:这题坑点就是题意,要求的是不能连续出现两个相同的后缀串. 分析: 定义dp[pos][j][k]dp[pos][j][k]为当前在pospos位置,当前要走jj...

Codeforces Round #365 (Div. 2) 703B Mishka and trip 水题

Mishka and trip time limit per test 1 second memory limit per test 256 megabytes in...
  • kyoma
  • kyoma
  • 2016-08-05 12:59
  • 235