英文题目翻译day4

Quoit 设计

你曾经在操场玩过quoit吗？Quoit是一个把圆环抛向一些玩具，直到所有玩具被圈住而结束的游戏。

在cyberground场地，每个玩具的位置都是固定的，并且圆环被精心设计为一次仅可以圈住一个玩具的大小。换句话说，为了让游戏看起来更吸引人，圆环被设计的具有最大的半径。给出场地的一个configuration（布局）,你来设法去找到这样一个圆环的半径。

假定每个玩具都是plane上的一个点。如果圆环的中心相对于一个点的距离小于圆环的半径就说这个点被圆环圈住。如果两个玩具被放置在相同的点上，圆环的半径被当作0。

输入

输入由几组测试样例组成。对于每一个样例，第一行包含一个整数N（2<=N<=100000），为场地玩具的总数。接下来N行，每行包含一对（x,y）玩具坐标。输入0时为输入结束。

输出

对于每个测试样例，输出一行为Cybergroung管理者所需的的圆环半径，精确到小数点后两位。

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.