+/AoC
advent of code
git clone https://git.julia.blue/+/AoC
34efc25
master
1from collections import defaultdict 2 3paths = defaultdict (list ) 4with open ("input" )as f : 5for line in f : 6l ,r = line .strip ().split ("-" ) 7if r != "start" and l != "end" : 8paths [l ].append (r ) 9if l != "start" and r != "end" : 10paths [r ].append (l ) 11 12# for p in paths.items(): 13# print(p) 14routes = set () 15 16 17def visit (current ,hist ,used ): 18hist = hist + (current ,) 19p = paths [current ] 20if current == "end" : 21routes .add (hist ) 22return 23for next in p : 24if next .islower ()and next in hist : 25if not used : 26visit (next ,hist ,True ) 27else : 28visit (next ,hist ,used ) 29 30 31visit ("start" , (),True ) 32# print() 33# for r in sorted(routes): 34# print(','.join(r)) 35len (routes )) 36routes .clear () 37visit ("start" , (),False ) 38# print() 39# for r in sorted(routes): 40# print(",".join(r)) 41len (routes ))