ZCMU新人训练赛B
来源:互联网 发布:能离线翻译软件 编辑:程序博客网 时间:2024/06/05 09:56
B - Light Bulb ZOJ - 3203
Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to earn more money. One day, he found that the length of his shadow was changing from time to time while walking between the light bulb and the wall of his house. A sudden thought ran through his mind and he wanted to know the maximum length of his shadow.
The first line of the input contains an integer T (T <= 100), indicating the number of cases.
Each test case contains three real numbers H, h and D in one line. H is the height of the light bulb while h is the height of mildleopard. D is distance between the light bulb and the wall. All numbers are in range from 10-2 to 103, both inclusive, and H - h >= 10-2.
<b< dd="">
For each test case, output the maximum length of mildleopard's shadow in one line, accurate up to three decimal places..
<b< dd="">
32 1 0.52 0.5 34 3 4
<b< dd="">
1.0000.7504.000
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string.h>#include<algorithm>#include<queue>#include<stack>#include<set>#include<map>#include<vector>using namespace std;typedef long long ll;const double esp=1e-8;;double H,h,D;double cal(double x){ return D-x+H-(H-h)*D/x;}double three_devide(double l,double r){ double left=l,right=r,mid,midd; while(left+esp<right) { mid=(right+left)/2; midd=(right+mid)/2; if(cal(mid)>=cal(midd)) { right=midd; } else { left=mid; } } return cal(right);}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%lf%lf%lf",&H,&h,&D); double l=D-h*D/H,r=D; double ans=three_devide(l,r); printf("%0.3f\n",ans); } return 0;}
- ZCMU新人训练赛B
- ZCMU新人训练赛B
- ZCMU新人训练赛A
- ZCMU新人训练赛J
- ZCMU新人训练赛K
- ZCMU新人训练赛A
- ZCMU新人训练赛A
- ZCMU新人训练赛F
- ZCMU新人训练赛I
- ZCMU新人训练赛J
- ZCMU-训练赛-A
- ZCMU-训练赛-Primary Arithmetic
- ZCMU-训练赛-Problem A: Freckles
- ZCMU-校赛B-1777
- ZCMU—B
- TJU训练赛—B
- ZCMU-1861-zbj的a+b
- ZCMU-1107: 迟来的A+B
- 数据结构之排序(一)
- iOS h.264裸流分析
- android中可伸缩图像的应用。
- [1]React 深入浅出-----React的介绍
- HDU
- ZCMU新人训练赛B
- 嗨翻C
- 389. Find the Difference
- eclipse中安装maven插件
- Hibernate的三种查询方式
- 基于 CentOS 7.x 的 DPDK Vhost-User 环境搭建
- pat 1070. 结绳
- 跳转回制定控制器
- spark job, stage, task介绍