UVA_10566_CrossedLadders
来源:互联网 发布:易趣网和淘宝网的不同 编辑:程序博客网 时间:2024/06/02 06:16
10566 - Crossed Ladders
Time limit: 3.000 secondsA 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
Each line of input contains three positive
oating
point numbers giving the values of x, y, and c.
Output
For each line of input, output one line with a
oating point number giving the width of the street in
feet, with three decimal digits in the fraction.
Sample Input
30 40 10
12.619429 8.163332 3
10 10 3
10 10 1
Sample Output
26.033
7.000
8.000
9.798
问题已知如图
这个问题从已知求解有困难
但是反过来想
所求d如果知道了那么很容易求对应的c
而且d越大c越小
于是可以通过二分答案解决
#include <iostream>#include <cstdio>#include <cmath>using namespace std;const double PI=acos(-1.0);const double EPS=1e-7;double x,y,c;bool isbig(double d){ double hx=sqrt(x*x-d*d); double hy=sqrt(y*y-d*d); if(hx*hy/(hx+hy)>=c) return 1; else return 0;}double bs(){ double lo=0,hi=min(x,y); double mid; while(hi-lo>=EPS) { mid=(hi+lo)/2; if(isbig(mid)) lo=mid; else hi=mid; } return lo;}int main(){ while(scanf("%lf%lf%lf",&x,&y,&c)!=EOF) { printf("%.3lf\n",bs()); } return 0;}
- UVA_10566_CrossedLadders
- Android开源项目 分类 便于查看
- Swift高级开发语言基础
- Spring Web Flow 入门demo(三)嵌套流程与业务结合 附源码
- NDK 编译常见问题总结
- 牛客网 | 用两个栈实现队列
- UVA_10566_CrossedLadders
- 一,开篇,一个完整的LibGDX小游戏
- 【信息安全知识】计算机病毒和木马
- HDFS应用
- Swift高级开发语言--函数
- Promise的前世今生和妙用技巧
- [Leetcode]Triangle
- Android-Universal-Image-Loader 图片异步加载类库的使用(超详细配置)
- Java-session过期后,拦截器拦截后页面跳不出iframe框架问题