QOJ.ac

QOJ

実行時間制限: 2.0 s メモリ制限: 512 MB 満点: 100 ハック可能 ✓

#12315. 五个点

統計

你在平面上放置了 $n$ 个不同的点。然后,你将从每个点出发,沿一个均匀随机且相互独立的选定方向画一条射线。求没有任何两条射线相交的概率。

输入格式

第一行包含一个整数 $n$ ($2 \le n \le 5$),表示点的数量。

接下来的 $n$ 行中,第 $i$ 行包含两个整数 $x_i$ 和 $y_i$ ($-100 \le x_i, y_i \le 100$),表示第 $i$ 个点的坐标。

任意两点不重合。

输出格式

输出没有任何两条射线有公共点的概率。你的答案必须精确到绝对或相对误差不超过 $10^{-9}$。

样例

样例输入 1

2
0 0
1 1

样例输出 1

0.7500000000000

样例输入 2

3
7 8
7 7
8 8

样例输出 2

0.4303385416667

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.