[Algorithm] 백준 - 일곱 난쟁이 (Brute force: 완전 탐색)

문제: (백준 일곱난쟁이) https://www.acmicpc.net/problem/2309

 

2가지 (Brute force와 순열) 방법으로 구현하였습니다.

 

[Brute force:완전탐색]

data = []
del_one = 0
del_two = 0

for _ in range(9):
    data.append(int(input()))
    
sum_val = sum(data)

for i in range(8):
    for j in range(i+1, 9):
        if sum_val-(data[i]+data[j]) == 100:
            del_one = data[i]
            del_two = data[j]


data.remove(del_one)
data.remove(del_two)

for i in data:
    print(i)

 

 

---

 

[파이썬 순열 구현]

from itertools import permutations

arr = [ int(input()) for _ in range(9)]

for i in list(permutations(arr, 7)):
    if sum(list(i)) == 100:
        answer = (list(i))
        answer.sort()
        
for num in answer:
    print(num)