SGU144-Meeting（几何概型）

最新推荐文章于 2018-04-09 20:30:00 发布

bingsanchun

最新推荐文章于 2018-04-09 20:30:00 发布

阅读量9.6k

点赞数

分类专栏： Math

本文链接：https://blog.csdn.net/bingsanchun1/article/details/17185053

版权

Math 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

144. Meeting

time limit per test: 0.5 sec.
memory limit per test: 4096 KB

Two of the three members of the winning team of one of the ACM regional contests are going to meet in order to train for the upcoming World Finals. They decided that they will meet sometime between X o'clock and Y o'clock. Because they never get anywhere on time (they were late even on the day of the regional contest), they did not set an exact time when they will meet. However, they decided that the one who gets first at the meeting point will not wait more than Z minutes for the other one (they calculated that, if the other one will not come within Z minutes from the arrival of the first of them, then it is very probable that he will not show up at all).
Knowing that, in the end, both of them will show up at some time between X o'clock and Y o'clock (not necessarily after an integer number of minutes), compute which is the probability that they will actually meet.

Input

The input will contain 2 integer numbers X and Y (0<=X<Y<=24) and one real number Z ( 0 < Z <= 60*(Y-X) ).

Output

You should output the required probability with 7 decimal digits (rounded according to the 8th decimal digit).

Sample Input

11 12 20.0

Sample Output

0.5555556

题目翻译：

两支地区ACM比赛的队伍决定为了国际决赛而在一起集训. 他们约定在某天的 X 时到 Y 时的某一时刻相会. 但由于他们很少按时到 (有的队伍比赛那天都会迟到), 他们没有设定一个确切的相遇时间. 然而, 它们约定先到的队伍要等待 Z 分钟(经过计算，他们认为如果过了这么久还没等到那么极有可能另一支队不会来了). 假如两支队都会在X 到Y 点的某一时刻出现 (不一定整点，整分，可以是任意时刻), 计算他们能够相会的概率.

简单的几何概型，自己画个图：

所以阴影部分面积所占的比例即为答案。

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
    double x,y,z,s;
    while(scanf("%lf%lf%lf",&x,&y,&z)!=EOF)
    {
        double l=(y-x)*60;
        s=l*l;
        double p=s-(l-z)*(l-z);
        printf("%.7f\n",p/s);
    }
    return 0;
}