zoukankan      html  css  js  c++  java
  • ZOJ 3203 Light Bulb

    如果L全在地面上:

    输出  h * D / H

    如果L全在墙上:

    输出  h

    否则:

    (D - X ) / X = Y / (H - h)

    L = D - X + h - Y

    然后对L求导即可

     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <math.h>
     4 #include <algorithm>
     5 using namespace std;
     6 
     7 int main(){
     8     double H,h,D,x,y,x0;
     9     int t;
    10     scanf("%d",&t);
    11     while(t--){
    12         scanf("%lf%lf%lf",&H,&h,&D);
    13         x0 = D - h * D / H;
    14         x = sqrt( D * (H - h) );
    15         y = (D - x) * (H - h) / x;
    16         if(x >= D)  printf("%.3lf
    ",h);
    17         else if(x < x0) printf("%.3lf
    ",h * D / H);
    18         else    printf("%.3lf
    ",h - y + D - x);
    19     }
    20     return 0;
    21 }
    Light Bulb

    Time Limit: 1 Second      Memory Limit: 32768 KB

    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.

    Input

    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.

    Output

    For each test case, output the maximum length of mildleopard's shadow in one line, accurate up to three decimal places..

    Sample Input

    3
    2 1 0.5
    2 0.5 3
    4 3 4
    

    Sample Output

    1.000
    0.750
    4.000
    
  • 相关阅读:
    Delphi中解析Xml的控件-SimDesign NativeXml
    DELPHI判断是否64位操作系统
    几个获取Windows系统信息的Delphi程序
    delphi假死线程堵塞解决办法
    Delphi ADO数据操作封装类
    Delphi的时间与字符串函数代码示例
    【BZOJ2132】圈地计划 最小割
    【BZOJ3544】[ONTAK2010]Creative Accounting 前缀和+set
    【BZOJ4281】[ONTAK2015]Związek Harcerstwa Bajtockiego LCA
    【BZOJ2083】[Poi2010]Intelligence test 二分
  • 原文地址:https://www.cnblogs.com/wushuaiyi/p/3648317.html
Copyright © 2011-2022 走看看