f = open('demo_2025.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((ans[0][0] + ans[1][0]) / 2 * 10000, (ans[0][1] + ans[1][1]) / 2 * 10000)

def centroid(cluster):

sd=[sum([((c1[0]-c2[0])**2+(c1[1]-c2[1])**2)**0.5 for c1 in cluster]) for c2 in cluster]

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

f=open('demo_2025_27_Б.txt')

f.readline() # Чи­та­ем стро­ку с за­го­лов­ка­ми столб­цов

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

# borders=[[-2,1,-1,3],[1,5,3,7]] # для файла A

borders=[[-1,3,0,3],[2,5,7,11],[5,8,4,7]] # для файла B

clusters=[[] for _ in range(len(borders))] # спи­сок из len(borders) пу­стых под­спис­ков

for s in stars:

tf=[b[0] < s[0] < b[1] and b[2] < s[1] < b[3] for b in borders]

if sum(tf)!=1: print('Ошиб­ка кла­сте­ри­за­ции', s, tf)

clusters[tf.index(True)].append(s)

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

answer=[int(sum([c[i] for c in centers])/len(centers)*10000) for i in range(2)]

print(*answer)

def centroid(cluster):

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

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

# функ­ция dist ра­бо­та­ет в не­сколь­ко раз быст­рее, чем вы­ра­же­ние

# ((star1[0] - star2[0])**2 + (star1[1] - star2[1])**2)**0.5

from math import dist

f = open('demo_2025_27_Б.txt')

f.readline() # Чи­та­ем (и иг­но­ри­ру­ем) стро­ку с за­го­лов­ка­ми столб­цов (X Y).

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

# Пе­ре­мен­ная radius - это ра­ди­ус круга, внут­ри ко­то­ро­го на­хо­дят­ся точки,

# при­со­еди­ня­е­мые к кла­сте­ру. Она долж­на быть мень­ше, чем ми­ни­маль­ное рас­сто­я­ние

# между звёздами раз­ных кла­сте­ров, но боль­ше, чем мак­си­маль­ное рас­сто­я­ние между

# звёздами од­но­го кла­сте­ра.

radius = 1.0

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)

# Ре­зуль­тат кла­сте­ри­за­ции: ко­ли­че­ство кла­сте­ров и их раз­ме­ры.

# Если кла­сте­ров боль­ше, чем в усло­вии, сле­ду­ет уве­ли­чить пе­ре­мен­ную radius,

# если мень­ше - умень­шить её.

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

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

answer = [int(sum([c[i] for c in centers]) / len(centers) * 10000) for i in range(2)]

print(*answer)

f = open('27A.txt')

m = []

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

for s in f:

x,y = [float(c) for c in s.split()]

m.append([x,y])

if -1 <= x <=2 and 6<= y <=9:

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

if 0 <= x <= 3 and 3<= y <=6:

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

if -1.5 <= x <= 0.5 and -1<= y <=2:

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

def centroid(claster):

maxi = 10**10

maxix, maxiy = 0,0

for x1,y1 in claster:

d = 0

for x2,y2 in claster:

d += ((x2-x1)**2 + (y2-y1)**2)** 0.5

if d < maxi:

maxi,maxix,maxiy = d, x1, y1

return maxix, maxiy

mini = min(len(i) for i in claster)

claster = [j for j in claster if len(j)!= mini]

center = [centroid(n) for n in claster]

sumx, sumy = 0, 0

for x,y in center:

sumx += x

sumy += y

otv1, otv2 = int(sumx*10000/len(center)), int(sumy*10000/len(center))

print(otv1, otv2)

f = open('27B.txt')

m = []

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

for s in f:

x,y = [float(c) for c in s.split()]

m.append([x,y])

if -2.5 <= x <=0.5 and -1.5<= y <=1.5:

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

if -0.5 <= x <= 2.5 and 3<= y <=5.5:

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

if 4 <= x <= 7 and 5<= y <=8:

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

if 3.5 <= x <= 6.5 and 1.5<= y <=4.5:

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

if 3 <= x <= 6.5 and -2.5<= y <=1.5:

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

def centroid(claster):

maxi = 10**10

maxix, maxiy = 0,0

for x1,y1 in claster:

d = 0

for x2,y2 in claster:

d += ((x2-x1)**2 + (y2-y1)**2)** 0.5

if d < maxi:

maxi,maxix,maxiy = d, x1, y1

return maxix, maxiy

mini = min(len(i) for i in claster)

claster = [j for j in claster if len(j)!= mini]

center = [centroid(n) for n in claster]

sumx, sumy = 0, 0

for x,y in center:

sumx += x

sumy += y

otv1, otv2 = int(sumx*10000/len(center)), int(sumy*10000/len(center))

print(otv1, otv2)

def centroid(cluster):

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

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

from math import dist

f = open('27A.csv')

f.readline() # Чи­та­ем (и иг­но­ри­ру­ем) стро­ку с за­го­лов­ка­ми столб­цов (X Y).

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

radius = 0.5

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)

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

clen=[len(c) for c in clusters]

del clusters[clen.index(min(clen))]

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

answer = [int(sum([c[i] for c in centers]) / len(centers) * 10000) for i in range(2)]

print( *answer )

f = open('273A.txt')

m = []

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

for s in f:

x,y = [float(c) for c in s.split()]

m.append([x,y])

if -1 <= x <=2 and 6<= y <=9:

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

if 0 <= x <= 3 and 3<= y <=6:

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

if -1.5 <= x <= 0.5 and -1<= y <=2:

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

def centroid(claster):

maxi = 10**10

maxix, maxiy = 0,0

for x1,y1 in claster:

d = 0

for x2,y2 in claster:

d += ((x2-x1)**2 + (y2-y1)**2)** 0.5

if d < maxi:

maxi,maxix,maxiy = d, x1, y1

return maxix, maxiy

maxi = max(len(i) for i in claster)

claster = [j for j in claster if len(j)!= maxi]

center = [centroid(n) for n in claster]

sumx, sumy = 0, 0

for x,y in center:

sumx += x

sumy += y

otv1, otv2 = int(sumx*10000/len(center)), int(sumy*10000/len(center))

print(otv1, otv2)

f = open('27B1.txt')

m = []

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

for s in f:

x,y = [float(c) for c in s.split()]

m.append([x,y])

if -2.5 <= x <=0.5 and -1.5<= y <=1.5:

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

if -0.5 <= x <= 2.5 and 3<= y <=5.5:

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

if 4 <= x <= 7 and 5<= y <=8:

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

if 3.5 <= x <= 6.5 and 1.5<= y <=4.5:

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

if 3 <= x <= 6.5 and -2.5<= y <=1.5:

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

def centroid(claster):

maxi = 10**10

maxix, maxiy = 0,0

for x1,y1 in claster:

d = 0

for x2,y2 in claster:

d += ((x2-x1)**2 + (y2-y1)**2)** 0.5

if d < maxi:

maxi,maxix,maxiy = d, x1, y1

return maxix, maxiy

maxi = max(len(i) for i in claster)

claster = [j for j in claster if len(j)!= maxi]

center = [centroid(n) for n in claster]

sumx, sumy = 0, 0

for x,y in center:

sumx += x

sumy += y

otv1, otv2 = int(sumx*10000/len(center)), int(sumy*10000/len(center))

print(otv1, otv2)

def centroid(cluster):

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

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

from math import dist

f = open('27B.csv')

f.readline() # Чи­та­ем (и иг­но­ри­ру­ем) стро­ку с за­го­лов­ка­ми столб­цов (X Y).

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

radius = 0.5

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)

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

clen=[len(c) for c in clusters]

del clusters[clen.index(max(clen))]

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

answer = [int(sum([c[i] for c in centers]) / len(centers) * 10000) for i in range(2)]

print( *answer )

import math

f = open('27A.txt')

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

for s in f:

x,y = [float(c) for c in s.split()]

if y < 2:

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

elif x < 3:

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

else:

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

del claster[claster.index(min(claster,key=len))]

radius = [0, 0]

for i in range(len(claster)):

tmp = 10**10

for x1, y1 in claster[i]:

maxi =0

for x2, y2 in claster[i]:

maxi = max(maxi, math.dist([x1,y1],[x2,y2]))

if maxi < tmp:

tmp = maxi

radius[i] = tmp

middle = sum([r for r in radius]) / 2

print(int(middle * 10000))

import math

f = open('27B.txt')

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

for s in f:

x,y = [float(c) for c in s.split()]

if x < -1.5:

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

elif x > 4 and y >6:

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

elif y > 5:

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

elif x > 2:

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

else:

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

del claster[claster.index(min(claster,key=len))]

radius = [0, 0, 0, 0]

for i in range(len(claster)):

tmp = 10**10

for x1, y1 in claster[i]:

maxi =0

for x2, y2 in claster[i]:

maxi = max(maxi, math.dist([x1,y1],[x2,y2]))

if maxi < tmp:

tmp = maxi

radius[i] = tmp

middle = sum([r for r in radius]) / 4

print(int(middle * 10000))

import math

f = open('27A.txt')

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

for s in f:

x,y = [float(c) for c in s.split()]

if y < 2:

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

elif x < 3:

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

else:

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

del claster[claster.index(max(claster,key=len))]

radius = [0, 0]

for i in range(len(claster)):

tmp = 10**10

for x1, y1 in claster[i]:

maxi =0

for x2, y2 in claster[i]:

maxi = max(maxi, math.dist([x1,y1],[x2,y2]))

if maxi < tmp:

tmp = maxi

radius[i] = tmp

middle = sum([r for r in radius]) / 2

print(int(middle * 10000))

import math

f = open('27B.txt')

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

for s in f:

x,y = [float(c) for c in s.split()]

if x < -1.5:

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

elif x > 4 and y >6:

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

elif y > 5:

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

elif x > 2:

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

else:

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

del claster[claster.index(max(claster,key=len))]

radius = [0, 0, 0, 0]

for i in range(len(claster)):

tmp = 10**10

for x1, y1 in claster[i]:

maxi =0

for x2, y2 in claster[i]:

maxi = max(maxi, math.dist([x1,y1],[x2,y2]))

if maxi < tmp:

tmp = maxi

radius[i] = tmp

middle = sum([r for r in radius]) / 4

print(int(middle * 10000))