Submission #62081369

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10**6)
n = int(input())
a = list(map(int, input().split()))
ans = set()
visited = set()
sm = sum(a)
def f(A):
    state = tuple(sorted(A))
    if state in visited:
        return
    visited.add(state)
    acc = 0
    for ai in A:
        acc ^= ai
    ans.add(acc)
    
    for i in range(n):
        for j in range(n):
            if i != j and A[j] > 0:
                tmp = A[:]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10**6)
n = int(input())
a = list(map(int, input().split()))
ans = set()
visited = set()
sm = sum(a)
def f(A):
    state = tuple(sorted(A))
    if state in visited:
        return
    visited.add(state)
    acc = 0
    for ai in A:
        acc ^= ai
    ans.add(acc)
    
    for i in range(n):
        for j in range(n):
            if i != j and A[j] > 0:
                tmp = A[:]
                tmp[i] += tmp[j]
                tmp[j] = 0
                f(tmp)
f(a)
print(len(ans))

Submission Info

Judge Result