[UVA][二分] 10649 - Danger Point＠Morris' Blog｜PChome Online 人新台

Morris' Blog 我在摸索我存在的意、生命的意、涵及值。有真正神手般的害，套用模式是大部分的情。那害的我存在的意何，托出神的存在？有候不能怪人不我，我已始省思，什我有人的原因，而是全要靠人。有候我我不同，那是因我做不到很多人能到的事情。我不到、玩不起、得不明、理解得不多，我缺少的文能力，就是一切一切能的判定。此，我不得能做些人有助的事情。我知道我自己是不服的性格，但在我不得不。我有能力，因此我必。我到底世界作什？充不定性，而我是法出拔萃，想一般人似乎也回不了了。越大的挑需要越力的支持，而我的支持是什？最近人，但都是失的局，人能接受，不需要言，不需要通，一切所想都表不出。
49的鼓 6站台

2013-06-26 13:53:10| 人526| 回0 | 上一篇 | 下一篇

[UVA][二分] 10649 - Danger Point

推 0 收藏 0 0 站台

Danger Point
Input: standard input
Output: standard output
Time Limit: 1 second

Jamal and Kamal were two friends. They were renowned for their friendship in their area. Once Jamal lend a big amount from Kamal and didn’t back that within time. At first Kamal didn’t say anything to Jamal but after few days when he understood that he was not going to give his money, he became rough on him. And the result is they are now enemies to each other. After 3 months there came another two friends to live, Rahim and Karim. Their houses stood such a way that the lines connecting Jamal's and Kamal's houses with Rahim areperpendicular; the same applies to Karim. Not only this, the line joining Rahim and Karim’s houses madeangle ‘Pi/4’ radians with the line joining Jamal and Kamal’s houses. Intersection of both of the joining lines was known as “Danger Point”. Know why? Same thing happened with Rahim and Karim! Money had done the damage in their friendship and when the four meet, surprisingly it is in that “Danger Point”, there arise a long quarrel. And others feel really annoyed with them. So, you a good programmer and neighbor of them decided to discontinue this situation. To solve this main problem, first you have to solve a little problem: Find out the distance of Rahim or Karim’s house from the “Danger Point”.

Input

You know the two data only, the distance between Jamal and Kamal’s house, and one distance from “Danger Point” to Rahim or Karim’s house. And you know you will stop when you find both of them zero. That is they will stay together.

Output

Output is a single-lined single value (6 digits after the decimal point) representing distance from “Danger Point” to Rahim or Karim’s house (other one's without the given one) for correct input set and for incorrect input set just print "INCORRECTINFORMATION !!!".

Sample Input

333.25 101.154
50.50 10.10
10.10 50.50
0 0

Sample Output/span>

212.827746
34.250766
INCORRECT INFORMATION !!!

Problem setter: Enamul Haque

Thanks to Derek Kisman for his alternate solution.

“It takes two to make a quarrel - it's clear two is the lower limit here, but the upper limit is unknown to me :)”

目描述：
Jamal Kamal 位在直上的端, Karim Rahim 是上的,
直交一 D (Danger Point), D Karim 的距你,
求 D 到 Rahim 的距。

目解法：
在, 直接算有繁。

另心 (0, 0) => x*x + y*y = r*r
而直是 y = -x + b
交有, 取左的 Karim 的所在, 二分查找 b 得答案,
然後就可以直接算的距了

其他人在 (r, 0) (-r, 0)

danger point 在 (b, 0)

#include <stdio.h>
#include <math.h>

int main() {
    double R, a;
    while(scanf("%lf %lf", &R, &a) == 2) {
        if(R == 0) break;
        double r = R/2;
        double low = -r, upp = r, b;
        double cnt = 0, tmp;
        double x, y;
        if(r*r*2 < a*a) {
            puts("INCORRECT INFORMATION !!!");
            continue;
        }
        while(cnt <= 50 && low <= upp) {
            b = (low+upp)/2;
            x = (2*b - sqrt(8*r*r-4*b*b))/4;
            y = (-x) + b;
            tmp = hypot(x-b, y);
            if(tmp < a)
                low = b;
            else
                upp = b;
            cnt++;
        }
        x = (2*b + sqrt(8*r*r-4*b*b))/4;
        y = (-x) + b;
        printf("%.6lf\n", hypot(x-b, y));
    }
    return 0;
}