B. Crossed ladders
来源:互联网 发布:安全员c证网络查询 编辑:程序博客网 时间:2024/06/04 21:11
B. Crossed ladders
Time Limit: 1000ms
Memory Limit: 32768KB
64-bit integer IO format: %I64d Java class name:Main SubmitStatus PID: 24431
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. Ay 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 exactlyc feet from the ground. How wide is the street?
Input
Each line of input contains three positive floating point numbers giving the values ofx, y, and c.
Output
For each line of input, output one line with a floating point number giving the width of the street in feet, with three decimal digits in the fraction.
Sample Input
30 40 1012.619429 8.163332 310 10 310 10 1
Sample Output
26.0337.0008.000
9.798
题意:两栋楼之间有两个梯子,如图中的虚线所示,一个梯子的长度为x,另一个梯子的长度为y,两个梯子的交点离地面的高度为c,问两栋楼之间的距离。
这是一个几何题。设宽度为w,交点距左楼距离为a,则根据三角形相似可以推出:
把第二个式子代入第一个式子可以得出一个等式,把方程左边写成关于w的函数,求导可得是减函数。因为w一定小于x,y中的最小值(三角形的直角边小于斜边),二分求出答案即可。
#include<stdio.h>#include<math.h>#include<cstdio>#include<algorithm>using namespace std;#define min(a,b) a <= b ? a : b;double x,y,c;double we(double w){ return 1-c/sqrt(y*y-w*w)-c/sqrt(x*x-w*w);}int main(){ while(scanf("%lf%lf%lf",&x,&y,&c)!=-1) { double r,l=0; r=min(x,y); double mid; while(r-l>1e-8) { mid=(l+r)/2; if(we(mid)>0) { l=mid; } else { r=mid; } } printf("%.3lf\n",mid); }}
0 0
- B. Crossed ladders
- Crossed ladders
- Crossed Ladders
- Crossed Ladders
- Crossed Ladders
- FZU 1148 Crossed ladders
- HOJ2015//Crossed ladders
- Hoj 2105 Crossed ladders
- Uva - 10566 - Crossed Ladders
- uva 10566 - Crossed Ladders
- UVA 10566 Crossed Ladders
- UVA - 10566 Crossed Ladders
- lightoj 1062 Crossed Ladders
- BNUOJ-24431-Crossed ladders
- UVa 10566 - Crossed Ladders
- E - Crossed Ladders
- 【Light】[1062]Crossed Ladders
- poj 2507 Crossed ladders
- nagios 笔记
- 1002. 写出这个数 (20)
- 算法练习3.Longest Substring Without Repeating Characters 最长不重复子字符串(map)
- android sdk 下各个文件夹的作用
- 【leetcode】Minimum Depth of Binary Tree
- B. Crossed ladders
- redis 使用
- 2326: [HNOI2011]数学作业
- 你真的会写单例模式吗——Java实现
- bzoj1103: [POI2007]大都市meg
- iOS程序猿之AFNetworking 3.0 版本使用
- 吐槽
- bzoj 3555: [Ctsc2014]企鹅QQ
- 简单几步解决 svchost 占用资源过高的问题