# Meeting

## 题目描述

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.

## 代码

#include <cstdio>

using namespace std;

struct Solver {
private:
int x, y; double z;
void input() { scanf(" %d %d %lf", &x, &y, &z); }
void process() {
int all = (y - x) * 60;
double sum = 0;
if (2 * z <= all) sum = z + 2 * (all - z) * (z / all) / 2;
else sum = z + 2 * z * (1 - z / all) / 2;
printf("%.8lf\n", sum / all);
}

public:
void solve() { input(), process(); }
} solver;

int main() {
solver.solve();
return 0;
}


418 I'm a teapot