Welcome   HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online
Home
FAQs
Problem Set
Practices
Online Contests
Major Exercises
OI Special
Judgement
Submit
Online Status
User Ranklist
Users
Register new
Login
Web Links
Hunan Normal University
College of Information Science and Engineering
Maple Trees in Mars
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB
Total submit users: 0, Accepted users: 0
Problem 10699 : No special judgement
Problem description
  There are a lot of trees in Mars. Jymy want to surround all the trees with the minimal required length of the rope . As follow,


To make this problem more simple, consider all the trees are circles in a plate. The diameter of all the trees are the same (the diameter of a tree is 1 unit). Jymy can calculate the minimal length of the rope , because it's so easy for this handsome boy.
But we don't have a rope to surround the trees. Instead, we only have some circle rings of different radius. Now I want to know the minimal required radius of the circle ring. And I don't want to ask him this problem, because he is busy preparing for the examination.
As a smart ACMer, can you help me ?

 

Input
  The input contains one or more data sets. At first line of each input data set is number of trees in this data set n 1 <= n <= 1000, it is followed by n coordinates of the trees. Each coordinate is a pair of integers, and each integer is in [-1000, 1000], it means the position of a trees center. Each pair is separated by blank.
Zero at line for number of trees terminates the input for your program.

Output
  Minimal required radius of the circle ring I have to choose. The precision should be 10^-2.

Sample Input
2
1 0
-1 0
0
Sample Output
1.50
Problem Source
  hdoj

Submit   Discuss   Judge Status  Problems  Ranklist 

HUNAN NORMAL UNIVERSITY ACM/ICPC Judge Online, Version 2010.5.5.final.
Web visits:18410 today,16241401 total, since 2010-05-07