Largest Circle
题号:NC15888
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
Special Judge, 64bit IO Format: %lld

题目描述

Yay! Small Small Blue finally managed to buy a tiny plot of land just about 10 kilometers from Shanghai Bund. Only... only it was so expensive that he is no more able to afford building a house there. So he decide to go for a swimming pool. It should have the form of circle, and be as big as possible inside his plot. Having carefully measured the border of his plot, he know now that it is a convex N-gon.
What is the largest possible radius of a circular pool in it?

输入描述:

There are multiple test cases in the input. There are at most 25 groups.

The first line of each case contains an integer N, 3≤N≤15000. The next N lines contain two integers each, xi and yi, not exceeding 107 by absolute value — the coordinates of the vertices of the plot (a convex polygon) in the counter-clockwise direction. No three vertices lie on the same line.

输出描述:

For each test case, output the sought radius. Absolute or relative difference between real answer and your solution should be less than 10-6.

示例1

输入

复制
4
0 0
10000 0
10000 10000
0 10000
3
0 0
10000 0
7000 1000
6
0 40
100 20
250 40
250 70
100 90
0 70
3
0 0
10000 10000
5000 5001

输出

复制
5000.0000000000
494.2336408886
34.5429484627
0.3535533897