1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36 | def recur(idx):
check[idx] = 1
tmp.append(n[idx])
if len(tmp) == 3:
a = sorted(tmp)
if sum(a) not in result:
result.append(sum(a))
else:
for i in range(7):
if check[i] == 0:
recur(i)
tmp.pop()
check[i] = 0
# def subset():
# for i in range(1<<7):
# tmp2 = 0
# cnt = 0
# for j in range(7):
# if i & (1<<j):
# tmp2 += n[j]
# cnt += 1
# if tmp2 not in result and cnt == 3:
# result.append(tmp2)
for t in range(int(input())):
n = list(map(int, input().split()))
result = []
for i in range(len(n)):
tmp = []
check = [0] * 7
recur(i)
# subset()
result.sort()
print("#{} {}".format(t+1, result[-5]))
|
댓글
댓글 쓰기