4.1.4--cup
来源:互联网 发布:2016微信数据报告 编辑:程序博客网 时间:2024/05/16 06:03
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
解题思路:通过这题又了解了,精度太高也会超时,比如exp=1e-7如果换为1e-9就会超时
代码:
#include<iostream>#include<cmath>#include<cstdio>using namespace std;#define exp 1e-7const double pi=3.14159265;double r1,r2,h;double work(double &m){ double R=m*(r2-r1)/h+r1; double v=(1.0/3.0)*pi*m*(R*R+r1*r1+R*r1); return v;}int main(){ int t; scanf("%d",&t); double v,val; while(t--) { scanf("%lf%lf%lf%lf",&r1,&r2,&h,&v); double mid,minn=0,maxn=100; while(minn<maxn) //此处若为<=,也会超时,因为可能又一直循环的情况 { mid=(minn+maxn)/2.0; val=work(mid); if(fabs(val-v)<exp) {break;} else { if(val>v) maxn=mid; else minn=mid; } } printf("%.6lf\n",mid); } return 0;}
阅读全文
0 0
- 4.1.4--cup
- hdu 4.1.3Cup
- Career Cup 1-4
- Career Cup 2-4
- Cup
- Cup
- Cup
- cup
- WHUST 2016 Summer Contest #4 D-Dice Cup
- Imagine CUP
- world cup
- Imagine Cup.......
- hdu_2289 cup
- hdu2289 Cup
- cup基础知识。。
- CUP原理
- hdu2289 CUP
- Cup---wa
- Qt实现IP输入框
- PAT程序设计考题——甲级1040 (最长回文串) C++实现
- 机房重构 导出Excel
- Docker Swarm 集群创建+Portainer 图形化管理实验
- UNICODE与ANSI的区别【转】
- 4.1.4--cup
- 腾讯研发类笔试面试试题(C++方向)
- PAT乙级真题及训练集(9)--1010. 一元多项式求导
- 排序算法比较
- 电子钱包交易过程中利用PSAM卡计算 TAC--交易验证码
- 排序——快速排序
- 10个值得收藏的实用HTML5代码片段分享
- Cassandra集群名称问题
- ORB特征点检测与匹配