Chef and Circle
You are given N points on 2-D plane. You have to find out minimal radius of a circle which contains at least M of these points. Input First line of the input contains two space separated integer N and M. Each of the next N lines contains two space separated real numbers denoting the x and y coordinates of i-th point, i.e. xi, yi. These numbers with not contain more than 5 digits after decimal p
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start