Clustering

Given $n$ points on a plane and an integer $k$, compute the largest possible value of $d$ such that the given points can be partitioned into $k$ non-empty subsets in such a way that the distance between any two points from different subsets is at least $d$. ###Input: The first line contains the number $n$ of points. Each of the following $n$ lines defines a point $(x_i, y_i)$ (both $x_i$ and $y_