|
| 1 | +# -------------------------------- Input data ---------------------------------------- # |
| 2 | +importos,grid,graph,dot,assembly,re,itertools,copy,functools |
| 3 | +fromcollectionsimportCounter,deque,defaultdict |
| 4 | + |
| 5 | +fromcompassimport* |
| 6 | + |
| 7 | + |
| 8 | +# This functions come from https://github.com/mcpower/adventofcode - Thanks! |
| 9 | +deflmap(func,*iterables): |
| 10 | +returnlist(map(func,*iterables)) |
| 11 | + |
| 12 | + |
| 13 | +defints(s:str): |
| 14 | +returnlmap(int,re.findall(r"-?\d+",s))# thanks mserrano! |
| 15 | + |
| 16 | + |
| 17 | +defpositive_ints(s:str): |
| 18 | +returnlmap(int,re.findall(r"\d+",s))# thanks mserrano! |
| 19 | + |
| 20 | + |
| 21 | +deffloats(s:str): |
| 22 | +returnlmap(float,re.findall(r"-?\d+(?:\.\d+)?",s)) |
| 23 | + |
| 24 | + |
| 25 | +defpositive_floats(s:str): |
| 26 | +returnlmap(float,re.findall(r"\d+(?:\.\d+)?",s)) |
| 27 | + |
| 28 | + |
| 29 | +defwords(s:str): |
| 30 | +returnre.findall(r"[a-zA-Z]+",s) |
| 31 | + |
| 32 | + |
| 33 | +test_data= {} |
| 34 | + |
| 35 | +test=1 |
| 36 | +test_data[test]= { |
| 37 | +"input":"""inp w |
| 38 | +add z w |
| 39 | +mod z 2 |
| 40 | +div w 2 |
| 41 | +add y w |
| 42 | +mod y 2 |
| 43 | +div w 2 |
| 44 | +add x w |
| 45 | +mod x 2 |
| 46 | +div w 2 |
| 47 | +mod w 2""", |
| 48 | +"expected": ["Unknown","Unknown"], |
| 49 | +} |
| 50 | + |
| 51 | +test="real" |
| 52 | +input_file=os.path.join( |
| 53 | +os.path.dirname(__file__), |
| 54 | +"Inputs", |
| 55 | +os.path.basename(__file__).replace(".py",".txt"), |
| 56 | +) |
| 57 | +test_data[test]= { |
| 58 | +"input":open(input_file,"r+").read(), |
| 59 | +"expected": ["92928914999991","91811211611981"], |
| 60 | +} |
| 61 | + |
| 62 | + |
| 63 | +# -------------------------------- Control program execution ------------------------- # |
| 64 | + |
| 65 | +case_to_test="real" |
| 66 | +part_to_test=2 |
| 67 | + |
| 68 | +# -------------------------------- Initialize some variables ------------------------- # |
| 69 | + |
| 70 | +puzzle_input=test_data[case_to_test]["input"] |
| 71 | +puzzle_expected_result=test_data[case_to_test]["expected"][part_to_test-1] |
| 72 | +puzzle_actual_result="Unknown" |
| 73 | + |
| 74 | + |
| 75 | +# -------------------------------- Actual code execution ----------------------------- # |
| 76 | + |
| 77 | +# Conver integer to 36-character binary |
| 78 | +# str_value = "{0:>036b}".format(value) |
| 79 | +# Convert binary string to number |
| 80 | +# value = int(str_value, 2) |
| 81 | + |
| 82 | + |
| 83 | +# The goal of this file is two-fold: |
| 84 | +# - The first part outputs a readable 'formula' for each step |
| 85 | +# - The second one executes the program for real |
| 86 | + |
| 87 | +# Based on the 1st part, I manually executed program steps |
| 88 | +# Each time a simplification was possible (= values yielding 0), I wrote & applied the corresponding hypothesis |
| 89 | +# At the end, I had a set of hypothesis to match & I manually found the 2 corresponding values |
| 90 | + |
| 91 | + |
| 92 | +program= [line.split(" ")forlineinpuzzle_input.split("\n")] |
| 93 | + |
| 94 | + |
| 95 | +generate_formula=False |
| 96 | +ifgenerate_formula:# Generating a formula |
| 97 | + |
| 98 | +defadd(a,b): |
| 99 | +ifa=="0": |
| 100 | +returnb |
| 101 | +ifb=="0": |
| 102 | +returna |
| 103 | +try: |
| 104 | +returnstr((int(a)+int(b))) |
| 105 | +except: |
| 106 | +iflen(a)<=2andlen(b)<=2: |
| 107 | +returna+"+"+b |
| 108 | +iflen(a)<=2: |
| 109 | +returna+"+("+b+")" |
| 110 | +iflen(b)<=2: |
| 111 | +return"("+a+")+"+b |
| 112 | +return"("+a+")+("+b+")" |
| 113 | + |
| 114 | +defmul(a,b): |
| 115 | +ifa=="0": |
| 116 | +return"0" |
| 117 | +ifb=="0": |
| 118 | +return"0" |
| 119 | +ifa=="1": |
| 120 | +returnb |
| 121 | +ifb=="1": |
| 122 | +returna |
| 123 | +try: |
| 124 | +returnstr((int(a)*int(b))) |
| 125 | +except: |
| 126 | +iflen(a)<=2andlen(b)<=2: |
| 127 | +returna+"*"+b |
| 128 | +iflen(a)<=2: |
| 129 | +returna+"*("+b+")" |
| 130 | +iflen(b)<=2: |
| 131 | +return"("+a+")*"+b |
| 132 | +return"("+a+")*("+b+")" |
| 133 | + |
| 134 | +defdiv(a,b): |
| 135 | +ifa=="0": |
| 136 | +return"0" |
| 137 | +ifb=="1": |
| 138 | +returna |
| 139 | + |
| 140 | +iflen(a)<=2andlen(b)<=2: |
| 141 | +returna+"//"+b |
| 142 | +iflen(a)<=2: |
| 143 | +returna+"//("+b+")" |
| 144 | +iflen(b)<=2: |
| 145 | +return"("+a+")//"+b |
| 146 | +return"("+a+")//("+b+")" |
| 147 | + |
| 148 | +defmod(a,b): |
| 149 | +ifa=="0": |
| 150 | +return"0" |
| 151 | + |
| 152 | +iflen(a)<=2andlen(b)<=2: |
| 153 | +returna+"%"+b |
| 154 | +iflen(a)<=2: |
| 155 | +returna+"%("+b+")" |
| 156 | +iflen(b)<=2: |
| 157 | +return"("+a+")%"+b |
| 158 | +return"("+a+")%("+b+")" |
| 159 | + |
| 160 | +defeql(a,b): |
| 161 | +ifa[0]=="i"andb=="0": |
| 162 | +return"0" |
| 163 | +ifb[0]=="i"anda=="0": |
| 164 | +return"0" |
| 165 | +ifa[0]=="i"andlen(b)>1andall(xin"1234567890"forxinb): |
| 166 | +return"0" |
| 167 | +ifb[0]=="i"andlen(a)>1andall(xin"1234567890"forxina): |
| 168 | +return"0" |
| 169 | + |
| 170 | +ifall(xin"1234567890"forxina)andall(xin"1234567890"forxinb): |
| 171 | +returnstr((a==b)*1) |
| 172 | + |
| 173 | +iflen(a)<=2andlen(b)<=2: |
| 174 | +returna+"=="+b |
| 175 | +iflen(a)<=2: |
| 176 | +returna+"==("+b+")" |
| 177 | +iflen(b)<=2: |
| 178 | +return"("+a+")=="+b |
| 179 | + |
| 180 | +return"("+a+")==("+b+")" |
| 181 | + |
| 182 | +vals= {i:"0"foriin"wxyz"} |
| 183 | +inputs= ["i"+str(i+1)foriinrange(14)] |
| 184 | +current_input=0 |
| 185 | +forj,instructioninenumerate(program): |
| 186 | +# print ('before', instruction, vals) |
| 187 | +ifinstruction[0]=="inp": |
| 188 | +vals[instruction[1]]=inputs[current_input] |
| 189 | +current_input+=1 |
| 190 | +else: |
| 191 | +operands= [] |
| 192 | +foriin (1,2): |
| 193 | +ifinstruction[i].isalpha(): |
| 194 | +operands.append(vals[instruction[i]]) |
| 195 | +else: |
| 196 | +operands.append(instruction[i]) |
| 197 | + |
| 198 | +operation= {"add":add,"mul":mul,"div":div,"mod":mod,"eql":eql}[ |
| 199 | +instruction[0] |
| 200 | + ] |
| 201 | + |
| 202 | +vals[instruction[1]]=functools.reduce(operation,operands) |
| 203 | + |
| 204 | +# The below are simplifications |
| 205 | +# For example if the formula is "input1+10==input2", this is never possible (input2 <= 9) |
| 206 | +ifj==25: |
| 207 | +vals["x"]="1" |
| 208 | +ifj==39: |
| 209 | +vals["x"]="i2+11" |
| 210 | +ifj==43: |
| 211 | +vals["x"]="1" |
| 212 | +ifj==57: |
| 213 | +vals["x"]="i3+7" |
| 214 | +ifj==58: |
| 215 | +vals["z"]="(i1+4)*26+i2+11" |
| 216 | +ifj==61: |
| 217 | +vals["x"]="(i3-7)!=i4" |
| 218 | +ifj==78: |
| 219 | +vals["x"]="0" |
| 220 | +ifj==93: |
| 221 | +vals["x"]="i5+11" |
| 222 | +ifj==95: |
| 223 | +vals["x"]="i5+1" |
| 224 | +ifj==97: |
| 225 | +vals["x"]="i5+1!=i6" |
| 226 | +ifj==94: |
| 227 | +vals[ |
| 228 | +"z" |
| 229 | + ]="((((i1+4)*26+i2+11)*(25*((i3-7)!=i4)+1))+((i4+2)*((i3-7)!=i4)))" |
| 230 | +ifj==115orj==133: |
| 231 | +vals["x"]="1" |
| 232 | +ifj==147: |
| 233 | +vals["x"]="i8+12" |
| 234 | +ifj==155: |
| 235 | +vals["x"]="(i8+5)!=i9" |
| 236 | +ifj==168: |
| 237 | +vals["x"]="0" |
| 238 | +ifj==183: |
| 239 | +vals["x"]="i10+2" |
| 240 | +ifj==185: |
| 241 | +vals["x"]="i10" |
| 242 | +ifj==187: |
| 243 | +vals["x"]="i10!=i11" |
| 244 | +ifj==196: |
| 245 | +vals["y"]="(i11+11)*(i10!=i11)" |
| 246 | +print("after",j,instruction,vals) |
| 247 | +ifj==200: |
| 248 | +break |
| 249 | + |
| 250 | +print(inputs,vals["z"]) |
| 251 | + |
| 252 | +else: |
| 253 | +add=lambdaa,b:a+b |
| 254 | +mul=lambdaa,b:a*b |
| 255 | +div=lambdaa,b:a//b |
| 256 | +mod=lambdaa,b:a%b |
| 257 | +eql=lambdaa,b: (a==b)*1 |
| 258 | + |
| 259 | +input_value="92928914999991"ifpart_to_test==1else"91811211611981" |
| 260 | +vals= {i:0foriin"wxyz"} |
| 261 | +inputs=lmap(int,tuple(input_value)) |
| 262 | +current_input=0 |
| 263 | +forj,instructioninenumerate(program): |
| 264 | +# print ('before', instruction, vals) |
| 265 | +ifinstruction[0]=="inp": |
| 266 | +vals[instruction[1]]=inputs[current_input] |
| 267 | +current_input+=1 |
| 268 | +else: |
| 269 | +operands= [] |
| 270 | +foriin (1,2): |
| 271 | +ifinstruction[i].isalpha(): |
| 272 | +operands.append(vals[instruction[i]]) |
| 273 | +else: |
| 274 | +operands.append(int(instruction[i])) |
| 275 | + |
| 276 | +operation= {"add":add,"mul":mul,"div":div,"mod":mod,"eql":eql}[ |
| 277 | +instruction[0] |
| 278 | + ] |
| 279 | + |
| 280 | +vals[instruction[1]]=functools.reduce(operation,operands) |
| 281 | +# print (instruction, vals) |
| 282 | +ifvals["z"]==0: |
| 283 | +puzzle_actual_result=input_value |
| 284 | + |
| 285 | + |
| 286 | +# -------------------------------- Outputs / results --------------------------------- # |
| 287 | + |
| 288 | +print("Case :",case_to_test,"- Part",part_to_test) |
| 289 | +print("Expected result : "+str(puzzle_expected_result)) |
| 290 | +print("Actual result : "+str(puzzle_actual_result)) |
| 291 | +# Date created: 2021-12-24 11:07:56.259334 |
| 292 | +# Part 1: 2021-12-25 02:07:10 |
| 293 | +# Part 2: 2021-12-25 02:16:46 |