시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
8 초 128 MB 27 6 2 50.000%

문제

A farmer has n goats. Coincidentally, he also has n fixed posts in a field where he wants the goats to graze. He wants to tie each goat to a post with a length of rope. He wants to give each goat as much leeway as possible – but, goat ropes are notorious for getting tangled, so he cannot allow any goat to be able to wander into another goat’s territory. What is the maximum amount of rope he could possibly use?

입력

There will be multiple test cases in the input. Each test case will begin with an integer n (2≤n≤50), indicating the number of posts in the field. On each of the next n lines will be a pair of integers, x and y (0≤x≤1,000, 0≤y≤1,000) which indicate the cartesian coordinates (in meters) of that post in the field. No two posts will be in the same position. You may assume that the field is large enough that the goats will never encounter its border. The input will end with a line with a single 0.

출력

For each test case, output a single floating point number, which indicates the maximum amount of rope that the farmer could possibly use, in meters. Output this value with exactly two decimal places, rounded. Output no spaces, and do not output a blank line between answers.

예제 입력

2
250 250
250 750
3
250 250
500 500
250 750
0

예제 출력

500.00
603.55

힌트

출처

University > North American Invitational Programming Contest > UCIPC 2013 F번

  • 문제의 오타를 찾은 사람: ntopia