ZOJ 3203 Light Bulb 三分\推公式

题意的话就是灯高H 人高h 灯与墙的距离为D 让你求最长的影子的长度

发现网上的题解似乎没有用三分光线与地面所成的角度的做法做的 Debug也持续了几个小时...

后来发现是少了一种情况 当人走到墙的后面的时候如果影子更长的话就不合题意了 要直接返回人的高度 加了这句话后终于AC了


代码如下:

#include <cstdio>
#include <cmath>
using namespace std;
double H, D, h;
double calc(double a) {
    double L = H / tan(a);
    if(L - D > 1e-11) {
        double d = L - D;
        double l = h / tan(a);
        if(L - l - D > 1e-9) {
            return h;
        }
        double h2 = d * tan(a);
        return l - d + h2;
    }
    else {
        return h / tan(a);
    }
}
int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        double l = 0.0, r = acos(-1.0) / 2.0, mid, mmid;
        scanf("%lf%lf%lf", &H, &h, &D);
        while(r - l > 1e-15) {
            mid = (l + r) / 2;
            mmid = (mid + r) / 2;
            if(calc(mid) > calc(mmid)) {
                r = mmid;
            }
            else l = mid;
        }
        printf("%.3lf\n", calc(mid));
    }
    return 0;
}

题目:

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 Hh 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


Author:  GUAN, Yao
Source:  The 6th Zhejiang Provincial Collegiate Programming Contest
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值