题库练习 Random Ranking
← 上一题 下一题 →

A9032 | Random Ranking

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Imagine a real contest or exam of $n$ participants. Every participant will get a particular score. We can predict the standings board more or less, if we do some statistics on their previous performance.

![](/uploads/acgo/image/5d2c04566e85e98a_1ac4797df15f.jpeg)Let's say the score of the participants will be uniformly distributed in interval $[l_{i},r_{i}]$ (the score can be a real number). Can you predict the standings board according to these data? In other words you should say for each participant the probability that he gets some fixed place in the scoreboard. The participants are sorted by increasing of their scores in the scoreboard. So, the participant with the largest score gets the last place.

输入格式

The first line contains integer $n$ ( $1<=n<=80$ ), showing how many participants we have. Each of the next $n$ lines contains our predictions, the $i$ -th line contains a pair of integers $l_{i},r_{i}$ $(0<=l_{i}<r_{i}<=10^{9})$ as the distributed interval for participant $i$ .

Consider the participants numbered from $1$ to $n$ in some way.

输出格式

Output a distributed matrix $a$ of order $n$ . The element $a_{ij}$ of the matrix is the probability that participant $i$ has rank $j$ .

Your answer will considered correct if it has at most $10^{-6}$ absolute or relative error.

输入输出样例

输入 #1
2
1 6
4 9
输出 #1
0.9200000000 0.080 
0.080 0.9200000000 
输入 #2
8
0 2
1 3
2 4
3 5
4 6
5 7
6 8
7 9
输出 #2
0.875 0.125 0 0 0 0 0 0 
0.125 0.750 0.125 0 0 0 0 0 
0 0.125 0.750 0.125 0 0 0 0 
0 0 0.125 0.750 0.125 0 0 0 
0 0 0 0.125 0.750 0.125 0 0 
0 0 0 0 0.125 0.750 0.125 0 
0 0 0 0 0 0.125 0.750 0.125 
0 0 0 0 0 0 0.125 0.875 
C++ 编辑器
输入
输出