F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Stars

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 315    Accepted Submission(s): 12


Problem Description
Many stars twinkling in the beautiful blue sky. The smart ACMer from earth, named Wiskey,sitting on a boat, thinking a stupid but hard problem: I want to use a balloon to contain all the stars in the sky, what's the smallest radius of the ballon?
 

Input
The input consists of multiple test cases. Each case begins with a line containing a positive integer n(2 <= n <= 10000), means the number of stars. Then following n lines each containing three positive integers (xi, yi, zi), indicates the coordinate of the i-th star in the sky.
 

Output
For each test case, output one line containing the smallest radius of a balloon used to contain all the stars in the sky. The answer should accurate up to 3 decimal places.
 

Sample Input
2 1 1 0 2 2 0
 

Sample Output
0.707
 

Author
8600
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 17:13:52, Gzip enabled