当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1007:Quoit Design

题目描述
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a time. On the other hand, to make the game look more attractive, the ring is designed to have the largest radius. Given a configuration of the field, you are supposed to find the radius of such a ring.

Assume that all the toys are points on a plane. A point is encircled by the ring if the distance between the point and the center of the ring is strictly less than the radius of the ring. If two toys are placed at the same point, the radius of the ring is considered to be 0.
输入解释
The input consists of several test cases. For each case, the first line contains an integer N (2 <= N <= 100,000), the total number of toys in the field. Then N lines follow, each contains a pair of (x, y) which are the coordinates of a toy. The input is terminated by N = 0.
输出解释
For each test case, print in one line the radius of the ring required by the Cyberground manager, accurate up to 2 decimal places.
输入样例
2
0 0
1 1
2
1 1
1 1
3
-1.5 0
0 0
0 1.5
0
输出样例
0.71
0.00
0.75
来自杭电HDUOJ的附加信息
Author CHEN, Yue
Recommend JGShining

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 ZJCPC2004

源链接: HDU-1007

最后修改于 2020-10-25T22:41:20+00:00 由爬虫自动更新

共提交 33

通过率 57.58%
时间上限 内存上限
10000/5000MS(Java/Others) 65536/32768K(Java/Others)