day24_optimizing.py

from collections import deque
import fileinput
import itertools

nums = list(itertools.repeat(list(range(9, 0, -1)), 14))

def main():
    i = 0
    for n in itertools.product(*nums):
        num = ''.join(map(str, n))
        inp = deque(num)
        x = y = z = w = 0

        w = int(inp.popleft())
        z += w + 6
        w = int(inp.popleft())
        z *= 26
        z += w + 2
        w = int(inp.popleft())
        z *= 26
        z += w + 13
        w = int(inp.popleft())
        x = z % 26 - 6
        z //= 26
        if x != w:
            z *= 26
            z += w + 8
        w = int(inp.popleft())
        z *= 26
        z += w + 13
        w = int(inp.popleft())
        x = z % 26 - 12
        z //= 26
        if x != w:
            z *= 26
            z += w + 8
        w = int(inp.popleft())
        z *= 26
        z += w + 3
        w = int(inp.popleft())
        z *= 26
        z += w + 11
        w = int(inp.popleft())
        z *= 26
        z += w + 10
        w = int(inp.popleft())
        x = z % 26 - 2
        z //= 26
        if x != w:
            z *= 26
            z += w + 8
        w = int(inp.popleft())
        x = z % 26 - 5
        z //= 26
        if x != w:
            z *= 26
            z += w + 14
        w = int(inp.popleft())
        x = z % 26 - 4
        z //= 26
        if x != w:
            z *= 26
            z += w + 6
        w = int(inp.popleft())
        x = z % 26 - 4
        z //= 26
        if x != w:
            z *= 26
            z += w + 8
        w = int(inp.popleft())
        x = z % 26 - 12
        z //= 26
        if x != w:
            z *= 26
            z += w + 2
        # print('Result for {}: {}', num, z)
        i += 1
        if i % 100000 == 0:
            print("Working, n = {}", num)
        if z == 0:
            print("Found valid model number: {}", num)
            exit()

if __name__ == "__main__":
    main()