AtCoder Grand Contest 021
B
Holes
AtCoder
⌀ 2130
原题
← AC →
翻译中…

Problem Statement

翻译中…

There are $N$ holes in a two-dimensional plane. The coordinates of the $i$-th hole are $(x_i,y_i)$.

翻译中…

Let $R=10^{10^{10^{10}}}$. Ringo performs the following operation:

翻译中…
  • Randomly choose a point from the interior of a circle of radius $R$ centered at the origin, and put Snuke there. Snuke will move to the hole with the smallest Euclidean distance from the point, and fall into that hole. If there are multiple such holes, the hole with the smallest index will be chosen.
翻译中…

For every $i$ $(1 \leq i \leq N)$, find the probability that Snuke falls into the $i$-th hole.

翻译中…

Here, the operation of randomly choosing a point from the interior of a circle of radius $R$ is defined as follows:

翻译中…
  • Pick two real numbers $x$ and $y$ independently according to uniform distribution on $[-R,R]$.
  • If $x^2+y^2\leq R^2$, the point $(x,y)$ is chosen. Otherwise, repeat picking the real numbers $x,y$ until the condition is met.
翻译中…

Constraints

翻译中…
  • $2 \leq N \leq 100$
  • $|x_i|,|y_i| \leq 10^6(1\leq i\leq N)$
  • All given points are pairwise distinct.
  • All input values are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
x_1 y_1
:
x_N y_N

翻译中…

Output

翻译中…

Print $N$ real numbers. The $i$-th real number must represent the probability that Snuke falls into the $i$-th hole.

翻译中…

The output will be judged correct when, for all output values, the absolute or relative error is at most $10^{-5}$.

翻译中…

样例

Input #1
2
0 0
1 1
Output #1
0.5
0.5
If Ringo put Snuke in the region $x+y\leq 1$, Snuke will fall into the first hole. The probability of this happening is very close to $0.5$. Otherwise, Snuke will fall into the second hole, the probability of which happening is also very close to $0.5$.
Input #2
5
0 0
2 8
4 5
2 6
3 10
Output #2
0.43160120892732328768
0.03480224363653196956
0.13880483535586193855
0.00000000000000000000
0.39479171208028279727
题目信息
题号
agc021_b
时间限制
2 s
内存限制
256 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。