FZU 1148 Crossed ladders
来源:互联网 发布:非农数据与黄金关系 编辑:程序博客网 时间:2024/05/22 05:46
Accept: 126 Submit: 251
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem 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
Each line of input contains three positive floating point numbers giving the values of x, 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 10 12.619429 8.163332 3 10 10 3 10 10 1
Sample Output
26.033 7.000 8.000 9.798
//二分逼近
- FZU 1148 Crossed ladders
- Crossed ladders
- Crossed Ladders
- Crossed Ladders
- 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
- B. Crossed ladders
- BNUOJ-24431-Crossed ladders
- UVa 10566 - Crossed Ladders
- E - Crossed Ladders
- 【Light】[1062]Crossed Ladders
- poj 2507 Crossed ladders
- 中国地理知识集锦
- 在MS Windows上安装、使用 ntop 及 Wireshark 来侦测网路异常流量
- 第一次装javaIDE,问题一大堆。
- 中国地理知识大全(转载)
- 中国地理知识
- FZU 1148 Crossed ladders
- 数据库设计之概念模型ER关系图
- VS2005隐藏快捷键
- FZU 1150 Farmer Bill's Problem
- Ruby之数组
- 测试并转载 Windows Live Writer 操作CSDN博客
- 用 SUSE Studio 客制化 openSUSE Linux 11.2,安装并使用 ntop 及 Wireshark 来侦测网路异常流量
- FZU 1563 Prime Numbers
- 擒敌拳套路