Problem H. maximum shortest distance
时间限制 1000 ms
内存限制 32 MB
There are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible.
输入数据
输出数据
For each case, output a line contains a real number with precision up to two decimal places.
样例输入
样例输出
$ Mathjax font initiator $