HDU 2289 Cup 二分
来源:互联网 发布:vb简易计算器代码 编辑:程序博客网 时间:2024/06/04 18:09
#include<stdio.h>#include<string.h>#include<math.h>#include<string>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<list>#include<map>#include<set>using namespace std;const double pi = 3.14159265358;const double eps =1e-8;double R, r, H, V;double cal_R(double x){ double tp = r + x * ( R - r) / H ; return tp;}int sign(double x){ if( x > eps) return 1; else if(x < -eps) return -1; else return 0;}bool OK(double x,double y,double hi){ double tp = x*x + x*y + y*y;// printf("v== %lf\n",tp/3*hi); double cur = tp * pi * hi /3; if( sign(V -cur) >= 0) return 1; else return 0;// printf("cur = %lf\n\n",cur);// printf("%d\n",cur-V);// if( cur >= V) return 0;// return 1;}void work(){ double st = 0, ed = H +10,mid;// cout << st << ed << endl; for(int i = 0 ; i < 100 ; i++){ mid = (st+ed)/2;// printf("mid = %lf\n",mid); double y= cal_R(mid);// printf("y== %lf\n",y); if(OK(r,y,mid)) st=mid; else ed=mid; } if(sign(st - H)>0) st = H; printf("%.6f\n",st);}int main(){//freopen("in.in","r",stdin); int T; scanf("%d",&T); while(T--){ scanf("%lf%lf%lf%lf",&r,&R,&H,&V);// printf("%lf %lf %lf %lf\n",r,R,H,V); work(); }return 0;}
Problem Description
The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?
The radius of the cup's top and bottom circle is known, the cup's height is also known.
The radius of the cup's top and bottom circle is known, the cup's height is also known.
Input
The input consists of several test cases. The first line of input contains an integer T, indicating the num of test cases.
Each test case is on a single line, and it consists of four floating point numbers: r, R, H, V, representing the bottom radius, the top radius, the height and the volume of the hot water.
Technical Specification
1. T ≤ 20.
2. 1 ≤ r, R, H ≤ 100; 0 ≤ V ≤ 1000,000,000.
3. r ≤ R.
4. r, R, H, V are separated by ONE whitespace.
5. There is NO empty line between two neighboring cases.
Each test case is on a single line, and it consists of four floating point numbers: r, R, H, V, representing the bottom radius, the top radius, the height and the volume of the hot water.
Technical Specification
1. T ≤ 20.
2. 1 ≤ r, R, H ≤ 100; 0 ≤ V ≤ 1000,000,000.
3. r ≤ R.
4. r, R, H, V are separated by ONE whitespace.
5. There is NO empty line between two neighboring cases.
Output
For each test case, output the height of hot water on a single line. Please round it to six fractional digits.
Sample Input
1100 100 100 3141562
Sample Output
99.99二分:最后要考虑水溢出的情况;
0 0
- HDU 2289 Cup(二分)
- HDU 2289 Cup 二分
- hdu 2289 Cup(二分)
- HDU 2289 Cup 数学+二分
- hdu 2289 Cup (二分)
- HDU 2289 Cup 二分求体积高度
- HDU 2289 Cup (二分搜索)
- HDU 2289 Cup(二分+圆台体积)
- HDU 2289 Cup(二分可以,但是除了二分呢?)
- HDOJ 2289 Cup(数学二分)
- HDUoj 2289 Cup (二分 高精度
- HDU 2289 Cup
- hdu 2289 CUP
- hdu 2289 cup
- hdu 2289 Cup
- hdu 2289 Cup (二分法)
- HDU 2289 Cup
- HDU 2289 Cup.
- HDU 4414 Finding crosses(暴力判断)
- C++ Primer 【第四版】第四章 数组和指针
- c#常见stream操作
- 关于字符编码,你所需要知道的
- 程序员的45个好习惯
- HDU 2289 Cup 二分
- 黑马程序员---------动态代理类与AOP
- Sed学习笔记
- C/C++编辑器Source Insight技巧收集
- C++ Primer 【第四版】第五章 表达式
- hdu3832-Earth Hour-最短路dij
- 那些我们容易忽略的好点子
- 音频 PCM音频编码格式详解
- GOF 23种设计模式 创建类模式 (2) 工厂方法模式