15届PythonB组-蓝桥村的真相

def chai(x, n):
    res = [0] * n
    index = 0
    while x:
        res[index] = x % 2
        x //= 2
        index += 1
    return res

def check(lis):
    n = len(lis)
    for i in range(n):
        if lis[i] == 0 and lis[(i+1)%n] + lis[(i+2)%n] == 1:
            return False
        if lis[i] == 1 and lis[(i+1)%n] + lis[(i+2)%n] != 1:
            return False
    return True

T = int(input())
for _ in range(T):
    N = int(input())
    N_bin = 2 ** N - 1
    ans = 0
    for x in range(N_bin + 1):
        lis = chai(x, N)
        if check(lis):
            ans += N - sum(lis)
    print(ans)