+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
c203ef0
master
1from z3 import * 2 3total = 0 4digits_list = [ 5"abcefg" , 6"cf" , 7"acdeg" , 8"acdfg" , 9"bcdf" , 10"abdfg" , 11"abdefg" , 12"acf" , 13"abcdefg" , 14"abcdfg" , 15] 16digits = {d :i for i ,d in enumerate (digits_list )} 17 18 19def transform (digits ): 20grid = [[int ((chr (ord ("a" )+ i ))in d )for i in range (7 )]for d in digits ] 21return grid 22# return [int("".join(map(str, row)), 2) for row in grid] 23 24 25grid = transform (digits ) 26grid ) 27 28with open ("input" )as f : 29for line in f : 30line = "acedgfb cdfbe gcdfa fbcad dab cefabd cdfgeb eafb cagedb ab | cdfeb fcadb cdfeb cdbaf" 31signal ,output = map (str .split ,line .split ("|" )) 32total += sum (map (lambda n :len (n )in [2 ,3 ,4 ,7 ],output )) 33 34signal = transform (signal ) 35signal ) 36S = [Int ("S_" + chr (ord ("a" )+ i ))for i in range (7 )] 37range_c = [And (0 <= S [i ],S [i ]<= 6 )for i in range (7 )] 38unique_c = [Distinct (S )] 39derived = [[None for _ in range (7 )]for _ in range (10 )] 40for i in range (10 ): 41for j in range (7 ): 42x = S [j ] 43derived [i ][x ]= signal [i ][j ] 44# derived = [ 45# Sum([(not not ((1 << i) & n)) << S[i] for i in range(7)]) for n in signal 46# ] 47# 48# B = [2, 5, 6, 0, 1, 3, 4] 49# blah = [sum((not not ((1 << i) & n)) << B[i] for i in range(7)) for n in signal] 50# print(blah) 51# print([any(g == d for g in grid) for d in blah]) 52# 53# match_c = [Or([(g == d) for g in grid]) for d in derived] 54s = Solver () 55s .add (range_c + unique_c + match_c ) 56assert s .check ()== sat 57m = s .model () 58m ) 59mapping = { 60chr (ord ("a" )+ i ):chr (ord ("a" )+ m .evaluate (S [i ]).as_long ()) 61for i in range (7 ) 62 } 63result = ["" .join (sorted (s .translate (mapping )))for s in output ] 64result = [digits_list .index (r )for r in result ] 65result ) 66 67import sys 68 69sys .exit () 70 71total )