POJ - 2507 Crossed Ladders
来源:互联网 发布:web前端和java哪个难 编辑:程序博客网 时间:2024/06/05 00:29
Crossed Ladders
Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Description
A narrow street is lined with tall buildings. An x foot long ladder is rested at the base of the building on the right side of the street and leans on the building on the left side. A y foot long ladder is rested at the base of the building on the left side of the street and leans on the building on the right side. The point where the two ladders cross is exactly c feet from the ground. How wide is the street?
Input
Input starts with an integer T (≤ 10), denoting the number of test cases.
Each test case contains three positive floating point numbers giving the values of x, y, and c.
Output
For each case, output the case number and the width of the street in feet. Errors less than 10-6 will be ignored.
Sample Input
4
30 40 10
12.619429 8.163332 3
10 10 3
10 10 1
Sample Output
Case 1: 26.0328775442
Case 2: 6.99999923
Case 3: 8
Case 4: 9.797958971
则由相似三角形得:c/a=(z-d)/z;c/b=d/z。消去中间变量d得:c/a+c/b=1,即(a+b)/a*b=c,构造函数F=(a+b)/(a*b)-c=0,而a,b可通过x,y,z求出。再用二分法求解即可
#include<cstdio> #include<cmath>#define eps 1e-7//精度 double x,y,z,c;double F(double z){return sqrt((x*x-z*z)*(y*y-z*z))/(sqrt(x*x-z*z)+sqrt(y*y-z*z))-c;}//定义F函数 int main(){ int t,ans=1; scanf("%d",&t); while(t--){ scanf("%lf%lf%lf",&x,&y,&c); double l=0,r=x<y?x:y,mid=(l+r)/2;//区间右端点取x,y中最小值 printf("Case %d: ",ans++); while(r-l>eps){ if(F(mid)>0)//F(mid)>0说明mid比实际的z要小,所以舍弃左半部分区间 l=mid;elser=mid;mid=(l+r)/2;}printf("%lf\n",mid); } return 0; }
0 0
- poj 2507 Crossed ladders
- POJ-2507 Crossed ladders
- POJ - 2507 Crossed Ladders
- POJ 2507 Crossed ladders 笔记
- poj 2507 crossed ladders(计算几何,二分)
- LightOJ 1062 & Poj 2507 Crossed Ladders
- poj 2507Crossed ladders 计算几何,二分
- poj 2507 Crossed ladders 二分解方程
- POJ 2507 Crossed ladders (二分)
- poj-2507-Crossed ladders【二分】【计算几何】
- UVA 10566 && POJ 2507 Crossed Ladders (几何)
- POJ:2507 Crossed ladders(二分+几何数学)
- POJ-2057 Crossed Ladders (二分,数学)
- Crossed ladders
- Crossed Ladders
- Crossed Ladders
- Crossed Ladders
- FZU 1148 Crossed ladders
- 传值传引用
- 什么是段错误
- 将12345转换为一万两千三百四十五
- Android设置虚线、圆角、渐变 (listview 设置虚线分隔线)
- 验证码无法显示:Could not initialize class sun.awt.X11GraphicsEnvironment 解决方案
- POJ - 2507 Crossed Ladders
- 递归实现字符串翻转
- visio2016企业批量授权版本的激活方式
- 如何让iOS应用从容地崩溃
- 屏蔽不需要的蜘蛛节省服务器资源
- lua文件读写
- zookeeper连接超时问题排查
- HDU5752 Sqrt Bo
- hdu 1281(二分图匹配+增广路)