Time limit per test: 0.25 second(s) Memory limit: 65536 kilobytes
input: standard output: standard
Yay! You've finally managed to buy a tiny plot of land just about 400 kilometers from Moscow. Only... only it was so expensive that you are no more able to afford building a house there. So you decide to go for a swimming pool. It should have the form of circle, and be as big as possible inside your plot. Having carefully measured the border of your plot, you know now that it is a convex N-gon.
What is the largest possible radius of a circular pool in it?
The first line of input contains an integer N, . 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.
Output the sought radius. Your solution will be accepted if it is within 10-3 of the correct one.
Codeforces (c) Copyright 2010-2021 Mike Mirzayanov