UVa11722
Posted Yan_Bin
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了UVa11722相关的知识，希望对你有一定的参考价值。
11722 Joining with Friend
You are going from Dhaka to Chittagong by train and you came to know one of your old friends is going
from city Chittagong to Sylhet. You also know that both the trains will have a stoppage at junction
Akhaura at almost same time. You wanted to see your friend there. But the system of the country is
not that good. The times of reaching to Akhaura for both trains are not fixed. In fact your train can
reach in any time within the interval [t1; t2] with equal probability. The other one will reach in any
time within the interval [s1; s2] with equal probability. Each of the trains will stop for w minutes after
reaching the junction. You can only see your friend, if in some time both of the trains is present in the
station. Find the probability that you can see your friend.
Input
The first line of input will denote the number of cases T (T < 500). Each of the following T line will
contain 5 integers t1, t2, s1, s2, w (360 t1 < t2 < 1080, 360 s1 < s2 < 1080 and 1 w 90). All
inputs t1, t2, s1, s2 and w are given in minutes and t1, t2, s1, s2 are minutes since midnight 00:00.
Output
For each test case print one line of output in the format ‘Case #k: p’ Here k is the case number and
p is the probability of seeing your friend. Up to 1e
以上是关于UVa11722的主要内容，如果未能解决你的问题，请参考以下文章
题解 UVA11722 Joining with Friend