Статья Автор: Ильичев Василий

решаю 27 задачу вслепую))))))

#20206, 20205
f = open('27.txt')

from math import dist



def sm_dist(p, A):
    sm = 0
    for i in A:
        sm += dist(i, p)
    return sm


def find_cent(A):
    ans = (-9999999, -9999999)
    for i in A:
        if sm_dist(i, A) < sm_dist(ans, A):
            ans = i
    return ans



A = []

for i in f:
    A.append(list(map(float, i.split())))


c = [(0, 0), (0, 0), (0, 0)]


clasters = [[], [], []]

for i in A:
    mn = float('inf')
    best_clast = -1
    for j in range(len(c)):
        if dist(i, c[j]) < mn:
            best_clast = j
    clasters[best_clast].append((i))


aver_x = sum([find_cent(i)[0] for i in clasters])
aver_y = sum([find_cent(i)[1] for i in clasters])

#20206, 20205
f = open('27.txt')

from math import dist



def sm_dist(p, A):
    sm = 0
    for i in A:
        sm += dist(i, p)
    return sm


def find_cent(A):
    ans = (-9999999, -9999999)
    for i in A:
        if sm_dist(i, A) < sm_dist(ans, A):
            ans = i
    return ans



A = []

for i in f:
    A.append(list(map(float, i.split())))


c = [(0, 0), (0, 0), (0, 0)]


clasters = [[], [], []]

for i in A:
    mn = float('inf')
    best_clast = -1
    for j in range(len(c)):
        if dist(i, c[j]) < mn:
            best_clast = j
    clasters[best_clast].append((i))


aver_x = sum([find_cent(i)[0] for i in clasters])
aver_y = sum([find_cent(i)[1] for i in clasters])

Чтобы оставить комментарий нужна авторизация

Печать