Submission #4659194

---

Source Code Expand

from itertools import permutations


def solve(pair, N, C):
    c = []
    surface = [True]*N
    for p in pair:
        c.append(C[int(p)])
    for i in range(len(c)):
        for j in range(i + 1, len(c)):
            if c[j] % c[i] == 0:
                surface[j] = not surface[j]

    return surface.count(True)


N = int(input())
S = [str(i) for i in range(N)]
C = [int(input()) for _ in range(N)]
permutation = list(permutations("".join(S)))
sum = 0
for p in permutation:
    sum += solve(p, N, C)
print(sum/len(permutation))

Submission Info

Judge Result