AtCoder Beginner Contest 151
翻译中…
Problem Statement
翻译中…
Given are $N$ points $(x_i, y_i)$ in a two-dimensional plane.
翻译中…
Find the minimum radius of a circle such that all the points are inside or on it.
翻译中…
Constraints
翻译中…
$2 \leq N \leq 50$$0 \leq x_i \leq 1000$$0 \leq y_i \leq 1000$- The given
$N$points are all different. - The values in input are all integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
x_1 y_1
:
x_N y_N翻译中…
Output
翻译中…
Print the minimum radius of a circle such that all the $N$ points are inside or on it.
翻译中…
Your output will be considered correct if the absolute or relative error from our answer is at most $10^{-6}$.
翻译中…
样例
Input #1
2
0 0
1 0
Output #1
0.500000000000000000
Both points are contained in the circle centered at $(0.5,0)$ with a radius of $0.5$.
Input #2
3
0 0
0 1
1 0
Output #2
0.707106781186497524
Input #3
10
10 9
5 9
2 0
0 0
2 7
3 3
2 5
10 0
3 7
1 9
Output #3
6.726812023536805158
If the absolute or relative error from our answer is at most $10^{-6}$, the output will be considered correct.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。