SPIの順列問題用に作ったけど出番なかった

numCardPermutation.py

# 順列（数字並べて倍数つくるやつ）

card = [0,1,2,3,4,5]

visited = [False] * len(card)
perm = []

def dfs(arr, pos, n):
    if pos == n:
        perm.append(arr)
        return
    for i in range(len(card)):
        if not visited[i]:
            visited[i] = True
            dfs(arr + [card[i]], pos + 1, n)
            visited[i] = False

dfs([], 0, 3)  # 第3引数: 桁数
cnt = 0
for p in perm:
    if p[0] == 0: continue
    p = int("".join(map(str, p)))
    if p % 6 == 0:  # 倍数か判定
        cnt += 1
print(cnt)