풀이시간: 16분
from itertools import combinations
heights = [int(input()) for _ in range(9)]
for ks in combinations(heights, 7):
if sum(ks) == 100:
result = sorted(list(ks))
for i in result:
print(i)
from itertools import combinations
heights = [int(input()) for _ in range(9)]
for combi in combinations(heights, 7):
if sum(combi) == 100:
for height in sorted(combi):
print(height)
break # 답이 여러개인경우 하나만 출력해야한다.
heights = [int(input()) for _ in range(9)]
heights.sort() # 처음부터 정렬가능
tot = sum(heights)
def f():
for i in range(8):
for j in range(i+1, 9):
if tot - heights[i] - heights[j] == 100:
for k in range(9):
if i != k and j != k:
print(heights[k])
return
f()