hdu 2285 Cup(二分,求圆台的体积)
来源:互联网 发布:jsp oracle 网站源码 编辑:程序博客网 时间:2024/04/28 20:59
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.999024#include<stdio.h>#include<string.h>#include<stdlib.h>#include<ctype.h>#include<math.h>#include<stack>#include<queue>#include<map>#include<set>#include<vector>#include<string>#include<iostream>#include<algorithm>#include<utility>typedef long long ll;const double Pi = acos(-1.0);const int N = 1e6+10, M = 1e3+20, mod = 1e9+7, inf = 2e9+10;const double e=2.718281828459 ;const double esp=1e-9;using namespace std;int t;double r,R,H,V;double volume(double x){ double r0=x*(R-r)/H+r; return Pi*x*(r0*r0+r*r+r0*r)/3.0;}int main(){ scanf("%d",&t); while(t--) { scanf("%lf%lf%lf%lf",&r,&R,&H,&V); double low=0.0; double high=H; while(high-low>esp) { double mid=(low+high)/2.0; if(volume(mid)>V) high=mid; else low=mid; } printf("%.6lf\n",low); } return 0;}
0 0
- hdu 2285 Cup(二分,求圆台的体积)
- HDU 2289 Cup(二分+圆台体积)
- HDU 2289 Cup 二分求体积高度
- 圆台体积公式的推导
- hdu2289 二分法 圆台体积
- zoj 1904 Beavergnaw 计算圆柱和圆台的体积
- hdu 3642 求长方体的体积交
- 【HDU】3255 求长方体并的体积
- 【HDU 3642 求长方体的体积并
- HDU 2289 Cup(二分)
- HDU 2289 Cup 二分
- hdu 2289 Cup(二分)
- HDU3756二分或三分求满足题意的圆锥体积
- HDU 2289 Cup 数学+二分
- hdu 2289 Cup (二分)
- 求圆柱体的体积
- 求圆柱体的体积
- 求立方体的体积
- BZOJ 2594 [Wc2006]水管局长数据加强版
- 基础练习——01子串
- 模拟退火算法——概率法解全局优化
- B. The Meeting Place Cannot Be Changed
- 基础练习——字母图形
- hdu 2285 Cup(二分,求圆台的体积)
- linux下python的easy_instal安装l
- cartographer(2)安装
- [poj1006]Biorhythms
- JavaScript 基础知识(简单易懂)
- Linux入门:进程间通信之消息队列
- Oracle数据库11gR2完全干净卸载
- bzoj1623
- Unity 3D游戏设计学习(一)