[백준]2231(분해합) & 1148(스타트와 링크)

2231

2231번: 분해합

N = int(input())

num = 1
sum = 0 
while True :  
    sum += num 
    for i in str(num):
        sum += int(i)         
    if sum == N :
        print(num)
        break
    if num > N : 
        print(0)
        break
    sum = 0 
    num += 1

코드 설명 

14889

14889번: 스타트와 링크

import sys
from itertools import combinations, permutations

input = sys.stdin.readline
N = int(input()) # 인원
arr = [] #능력치 받기 

for n in range(N):
    arr.append(list(map(int,input().split())))
    
player = list(range(1,N+1))
case = list(combinations(player,N//2))
score_dif = []
for i,j in zip(case[:len(case)//2],list(reversed(case[len(case)//2:]))):
    team1 = list(permutations(i,2))
    team2 = list(permutations(j,2))
    score1, score2 = 0, 0
    for a,b in team1 :
        score1 += arr[a-1][b-1]
    for a,b in team2 :
        score2 += arr[a-1][b-1]
    dif = abs(score1-score2)
    score_dif.append(dif)
print(min(score_dif))

코드 설명