제출 #879253

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879253		dilshod9890	Bootfall (IZhO17_bootfall)	Cpython 3	6 / 100	1016 ms	18828 KiB

bootfall

n = int(input())
a = list(map(int,input().split()))

def rec(b,i):
    
    if i==len(a):
        c.append(abs(sum(a)-2*sum(b)))
        return
    b.append(a[i])
    rec(b,i+1)
    
    b.pop()
    rec(b,i+1)


c = []
for i in range(n):
    rec([],0)
if min(c) != 0:
    print(0)
else:
    c = []
    g = []
    for i in range(n):
        d = a[i]
        a.pop(i)
        rec([],0)
        a.insert(i,d)
        c.sort()
        g.append(set(c))
        c = []
    c = g[0]
    for i in g:
        c = c.intersection(i)
    c = list(c)
    c.sort()
    print(len(c))
    for i in c:
        print(i,end=" ")

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 21
• Subtask 6: 0 / 35