from math import *

f = open('DEMO_27_A.txt')

claster = [[] for i in range(2)]

for s in f:

x,y= map(float, s.split())

if y < 8:

claster[0].append((x,y))

else:

claster[1].append((x,y))

def centroid(claster):

rad = []

for i in claster:

rad.append((sum(dist(i,j) for j in claster),i))

return min(rad)[1]

centr = [centroid(i) for i in claster]

Px = min(x for x, y in centr) *10000

Py = min(y for x, y in centr) *10000

print(int(abs(Px)), int(abs(Py)))

from math import *

f = open('DEMO_27_B.txt')

claster = [[] for i in range(3)]

for s in f:

x,y= map(float, s.split())

if 14 > x > 8 and 18 > y > 12:

claster[0].append((x,y))

elif 18 > x > 12 and 27 > y > 22:

claster[1].append((x,y))

elif 23 > x > 18 and 26 > y > 23:

claster[2].append((x,y))

def centroid(claster):

rad = []

for i in claster:

rad.append((sum(dist(i,j) for j in claster),i))

return min(rad)[1]

def max_d(claster):

return max(dist(centroid(claster),i) for i in claster)

claster_s = sorted(claster, key=len)

centr = [centroid(i) for i in claster_s]

Q1 = dist(centr[0], centr[2])

Q2 = max(max_d(i) for i in claster_s)

print(int(Q1 * 10000), int(Q2 * 10000))

f = open('DEMO_27_A.txt')

f.readline()

ans = []

min_summ = 10**10

stars = [list(map(float, s.replace(',','.').split())) for s in f]

for i in range (len(stars) - 1):

for j in range(i+1, len (stars) - 1):

center1 = stars[i]

center2 = stars[j]

summ = 0

for star in stars:

d1 = ((star[0] - center1[0]) ** 2 + (star[1] - center1[1]) ** 2)**0.5

d2 = ((star[0] - center2[0]) ** 2 + (star[1] - center2[1]) ** 2)**0.5

summ += min(d1, d2)

if summ < min_summ:

min_summ = summ

ans = [center1, center2]

print(min(ans[0][0], ans[1][0]) * 10000, min(ans[0][1],ans[1][1]) * 10000)

from math import dist

def clusterization(stars,radius): # кла­сте­ри­за­ция

clusters=[]

while stars:

cluster=[stars.pop()]

for c in cluster:

near=[s for s in stars if dist(c,s) < radius]

cluster+=near

for n in near: stars.remove(n)

clusters.append(cluster)

return clusters

def center(cluster): # на­хож­де­ние цен­тра кла­сте­ра

sumdist=[sum([dist(star1,star2) for star1 in cluster]) for star2 in cluster]

return cluster[sumdist.index(min(sumdist))]

def maxdist(cluster,center): # мак­си­маль­ное рас­сто­я­ние от цен­тра кла­сте­ра до звез­ды

return max([dist(s,center) for s in cluster])

radius = 1 # по­ро­го­вое рас­сто­я­ние для кла­сте­ри­за­ции

# Файл A

stars = [tuple(map(float,s.replace(',','.').split())) for s in open('DEMO_27_A.txt')]

clusters=clusterization(stars,radius)

print('кла­сте­ров:',len(clusters),'; точек:',*[len(c) for c in clusters]) # для кон­тро­ля

centers=[center(c) for c in clusters]

print(int(min([x[0] for x in centers])*10000),int(min([x[1] for x in centers])*10000))

# Файл B

stars = [tuple(map(float,s.replace(',','.').split())) for s in open('DEMO_27_B.txt')]

clusters=clusterization(stars,radius)

print('кла­сте­ров:',len(clusters),'; точек:',*[len(c) for c in clusters])

clusters=[c for c in clusters if len(c)>1] # уда­ле­ние кла­сте­ров из одной звез­ды

centers=[center(c) for c in clusters]

numbers=[len(c) for c in clusters] # ко­ли­че­ства звезд в кла­сте­рах

q1=dist(centers[numbers.index(min(numbers))],centers[numbers.index(max(numbers))])

q2=max([maxdist(clusters[i],centers[i]) for i in range(len(clusters))])

print(int(q1*10000),int(q2*10000))