[백준] 14889: 스타트와 링크

https://www.acmicpc.net/problem/14889

 

 

예제2번 예시

조합)

import sys
from itertools import combinations
n = int(sys.stdin.readline())
graph = [ list(map(int, sys.stdin.readline().split())) for _ in range(n) ]
members = list(range(n)) #1
min_value = sys.maxsize #2

for r1 in combinations(members, n//2): #3
    start, link = 0, 0
    r2 = list(set(members) - set(r1)) #4
    for r in combinations(r1, 2): #5
        start += graph[r[0]][r[1]]
        start += graph[r[1]][r[0]]
    for r in combinations(r2, 2): #6
        link += graph[r[0]][r[1]]
        link += graph[r[1]][r[0]]
    min_value = min(min_value, abs(start-link)) #7
print(min_value)

 

백준: 6603번 : 로또, 사탕 게임