寒假翻译题训练 1月24号

链接：https://acs.jxnu.edu.cn/problem/HDU1007

题目：

描述：

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.

翻译如下

描述：

你在操场上玩过套环吗？这种游戏的规则是这样的：操场上有很多玩具，如果你用套环套住了玩具，那你就可以拿着这个玩具作为奖励。

在一片区域里，每一个玩具的位置都是固定的，套环一次性只能套住一个玩具。另一方面，为了让这个游戏更具有吸引力，套环的半径被设计成了最大。现在给出了一片区域，你要求出环的半径。

每一个玩具均视为一个质点。如果一个玩具到环的圆心的距离小于环的半径，那么该玩具就视为被环套住了。如果两个玩具被重叠放置在了同一个地方，则环最大的半径视为0。

输入：

输入包含多组样例。对于每组样例，第一行包含一个整数N (2 <= N <= 100,000)，表示这片区域里玩具的总数。接下来N行，每一行包括两个实数x，y，即该玩具的坐标(x, y)。当输入的N为0时，终止输入。

输出：

对于每组样例，输出管理员应当提供的套环的半径，精确到小数点后2位。