thor/advent-of-code-go
1
0
Fork 0
mirror of https://github.com/Threnklyn/advent-of-code-go.git synced 2026-06-07 12:45:10 +02:00
Code Issues Packages Projects Releases Wiki Activity

removed input and prompt files per aoc-creator

Browse Source
This commit is contained in:
alexchao26
2020-12-22 16:12:08 -05:00
parent 28f8cd85ed
commit 9f476aa8f3
78 changed files with 0 additions and 21162 deletions
Download Patch File Download Diff File Expand all files Collapse all files
2018/day01/input.txt
-1028
View File
File diff suppressed because it is too large Load Diff
2018/day02/input.txt
-250
View File
@@ -1,250 +0,0 @@
ayitmcjvlhedbsyoqfzukjpxwt
agirmcjvlheybsyogfzuknpxxt
wgirmcjvlvedbsyoqfzujnpxwt
agizmcjvlhedbsyoqfzuenlxwt
aryrmcjvlheebsyoqfzuknpxwt
agirmcjelhedbsyoqfzukosxwt
azirmcjvlhedbsooqfzuknpxvt
agirmcjvffedbsyoqfzudnpxwt
agilmcjvlhedbsyrqfzuknpxrt
agirmcjvlhndbsyoofzukcpxwt
awirmcjvlhedbsyoqfzuknpxlz
aghrmcjmlhewbsyoqfzuknpxwt
apirmcjvlmedbsyoqfzcknpxwt
jgiricjvlhedbsyrqfzuknpxwt
abirmcjvlbedbsyoqfzuknpxwo
agirmcjvlhedbsyojfzuknpgkt
agicmclvlhedbmyoqfzuknpxwt
aslrzcjvlhedbsyoqfzuknpxwt
agiqmcjvlhedbsymqfzurnpxwt
agirmcjvlwedbsyoqfzuknfxmt
agiumcjvlhedbsyoqfzuknpbyt
xgirxcjvlwedbsyoqfzuknpxwt
bgtrvcjvlhedbsyoqfzuknpxwt
afirmcjvlpedbsyoqvzuknpxwt
agirmcjjvhedbsyoqfzukmpxwt
ggirmcjvlhedbsyoqfzukypxvt
agirmdjulhekbsyoqfzuknpxwt
agirmcjqlhedbsyoqfztknixwt
agirmcjvjhedbsyomfduknpxwt
agirmcjvlhedbgyoqfzuknpxtq
agirmvjvlhbdbsyfqfzuknpxwt
agirmcjvlhedbsyatfzbknpxwt
agirmcjvlrlybsyoqfzuknpxwt
agirmajvlhedbsqovfzuknpxwt
abinmcrvlhedbsyoqfzuknpxwt
agnrmcjvlhedbsyurfzuknpxwt
agirmpjvlhedbsyoqezuknpxct
agirmxjvlhedbsgoqjzuknpxwt
agirmcjvlhehbstoqfzuknpxht
qgirmcjvlhepcsyoqfzuknpxwt
tgirmcjvlhkdbsyoqszuknpxwt
agirmcjvdhedbscoqftuknpxwt
agbrmcjvlhedbsyoqfzukqpxwj
agurmcjvlhedbsyaqfzuknpxmt
agirmcjvohudbsyoqfmuknpxwt
agirmcjvlhekbsyoqfbuktpxwt
agirmcjvlhedhsyoqfzugnnxwt
agirmcjvlhedbsyjqyzuknpxft
agirmcjvlhedbsymufznknpxwt
agirmcjhlheubsyoqfzuknpxmt
agirmcjvlhwdbsywqfzwknpxwt
agirmcjvljedbsgqqfzuknpxwt
aglrmcjelhedbsyoqfzuknpxkt
agxrmcjvlhxdbsyoqfquknpxwt
agirmcjvnhedbsyoqfzuenfxwt
agirmcjvlhedbsyoqfzatnqxwt
agirmcvvlhedbsboqfzuknuxwt
agirncjvlhezbsyoqfzulnpxwt
agiamcjvdiedbsyoqfzuknpxwt
agirmcjvwhedbskoqfzhknpxwt
agiwmcjflhedbsyoqfzulnpxwt
agirmcjvlhedboyoqfzuknpjwl
agivmcjslhedbsyoqfzdknpxwt
agirmcjvlcedbsyoqfzukepxyt
akirmcjvlhjdbssoqfzuknpxwt
agvrmcjvldedmsyoqfzuknpxwt
agirecjvlhidbsyoqfzukbpxwt
abirmcjvlhjdbsyoqfkuknpxwt
agirmcjelhedbfyoqfzuknpxwj
agirmcjvlhedbbyoqrzukwpxwt
akirmcjvlhedbsyoyfzuknplwt
agirmcjvlhedbsydsfzuknpxwq
agirrcjvlhedbsyoqazuknpmwt
aeirmcjvlhedbsyoqfvuknpwwt
akirmcjvlhedbsyoqpzudnpxwt
agijmcjvlhedbsyuqfzunnpxwt
agirmcjilhedasyoqizuknpxwt
agirmczvlhzdbsyoqfzuknpxwx
agirmcjvlhehbsyoifzuknpxwo
agirwcjvlhedbsyoqfzuenpxst
agirmcjvlhedbsyoquzuknhxft
agirmcqvlkedbsyoqfzrknpxwt
agirmcqvlhenbsyoqfzuknpuwt
agirmcjvleedbsyoqfzhhnpxwt
agirmcjvlhembsyrqfauknpxwt
agirmcjvlhedbssoqflcknpxwt
aqirmcjvlnedbsyoqfzuknpxpt
agirmcjqlhedbxpoqfzuknpxwt
fgirmcjvlhedbsyoqfzukqpqwt
aggrmcjvlhpdbsyoqfzuknpxjt
agirmwjvlhedbsywqfzuknpzwt
agirmcailhembsyoqfzuknpxwt
aglrmcjvlhxdbsyoqfzuknpxet
xgirmcjvlhzdbsyoqfzukrpxwt
agvrmcjvuhedbsyoqfzuknpxgt
agikmcjvlhecbsyoqfzuknpxwr
agyrmcjvlhezbsyoqfouknpxwt
agirmcjvfhjdbsyokfzuknpxwt
agkrmjjvlhedtsyoqfzuknpxwt
agirmgjvlhedbiyoqfzuknpxwv
wcirmcjvlhedbsyoqfzuknpxwo
aairmcjvlhedbstoqfguknpxwt
hgirmcjvlhedwfyoqfzuknpxwt
agirmcjvmhfdbmyoqfzuknpxwt
agirmcjvlhvdbsioqfzuanpxwt
agrrmcjvgsedbsyoqfzuknpxwt
agirmcjvlqetbsysqfzuknpxwt
agirccjvlhedbsyoqfzuknkcwt
agirmqjvlhedbsdoqfzkknpxwt
agirmcjvlheobsyopfzuknpxwg
agirmcjolhedbsyofpzuknpxwt
agirmcjnlhedbsyoqkzukfpxwt
agiumcjvlheabsyoqfzuknpxbt
agipmcjvlhedbsyoqfzukupxwz
atirmcrvlhedbsyoqfnuknpxwt
agirmcjvnhedfkyoqfzuknpxwt
agirmrjvlhedboyoqfzvknpxwt
abhrmcjvlhedbtyoqfzuknpxwt
cbirmcjvlhedbfyoqfzuknpxwt
agirmcjvlhedbsyoqfmwknjxwt
ahirmcjvlhedbsloqfzuknpfwt
agarmjjvlhedbsyoqfzyknpxwt
ajirmcjvlhevjsyoqfzuknpxwt
agirmcjvlhpdbstoqfzuknpewt
agirmcsvlhedbsyoqfbupnpxwt
agirmcjvlhexbsyodfzukqpxwt
auiymcjblhedbsyoqfzuknpxwt
azirmcjvchedbsyoqfziknpxwt
aeirmcjvlhedvsyoqfzuonpxwt
agirmcjvlhedbfyoqfbukjpxwt
ygirmcjvlhidbsyoqfzukncxwt
agirmxpvlhedbsyoqffuknpxwt
ztirmcjvlhedosyoqfzuknpxwt
agirmcjvlhepbsyoqfzuenppwt
agirmcjvshedbsyoqnzaknpxwt
awirmcjvlhydbsyoqfzuknoxwt
ucirmcjvlhedbsyoqfjuknpxwt
agirmwjvlhkbbsyoqfzuknpxwt
agirmcjvldedbsyohfzuknpxzt
agirmcjvwhedbsyoqfznknpxgt
agiricjvlhedxqyoqfzuknpxwt
agirmcjvlhzdbjyoqfzukapxwt
agirmcgvlhedbsyoqfzuknaowt
agidmcjvlhedbsyoqayuknpxwt
agirmcjvlhedisnoqfzuknpxnt
wkjrmcjvlhedbsyoqfzuknpxwt
agirmcjvlhedbuyojfzukxpxwt
agkrmcjvlhedbsybqfzurnpxwt
agirmcjvghedbsyoqfzuknexwj
agirmcjvnhedbsyoqfzuznpxit
agirmcjvlbedbsyoqfiukwpxwt
agirlctvlheabsyoqfzuknpxwt
agirmcjzzhedbsyoqfzcknpxwt
akirmcjvlnedbsyoqfzlknpxwt
agirmdjvlhedpsyoqfzuknpjwt
agiyjcuvlhedbsyoqfzuknpxwt
agirmcbvltedysyoqfzuknpxwt
agirmcjvlhedfdyoqfzubnpxwt
agidmcjvlhedesfoqfzuknpxwt
aeirmcjvlhedqsyoqfxuknpxwt
agifmcjvlhedbsyoqfquknptwt
agidmcjvlhedbsyfqfzuknpxwb
agirvcjvlhedbsroqfzuknjxwt
agirmcqvlhddbsyoqfzuknpxwj
agirmcjvlhmdqsyoqizuknpxwt
atirmcjvltedbsyoqfzuknpxwz
agirxnjvlhedbsyoqfzuknpxkt
agihmcjvlhedbsyoqfzukepxqt
agirmcjvlhedbsmoqzsuknpxwt
agirycjvlhedbuyoqfwuknpxwt
agirmcjvlhedbsyoqfzfkrfxwt
agirzcjvlhedbsyoqfhuknpxnt
agigmcjvlhedbsqnqfzuknpxwt
agirmgzvlhedbsyoqfzuonpxwt
agirmcjvqhedbqyoqfzukqpxwt
anarmcjvlhedbsyocfzuknpxwt
agirmcjuihedbshoqfzuknpxwt
agirdckvlhedbsyoqfzxknpxwt
ugirmujvlhwdbsyoqfzuknpxwt
mgirmcjvlheobsyovfzuknpxwt
agirmcjvghedbsyoqfzufxpxwt
agirmcjvlhedbsyoinzuknuxwt
agirmzjvlhbdbsyoqfzlknpxwt
agivmcjvlhedbsconfzuknpxwt
agirmwfvlhedtsyoqfzuknpxwt
agirmcjvlhedbbyoqrzukncxwt
agirmcjvlhelbsyoqfzupnlxwt
agirmmjvluedqsyoqfzuknpxwt
agjrmcjvlhedbsyaqfcuknpxwt
agiwmcjvlhedbsyoqzzuknpswt
agirxcjvlhedbsyoqfyvknpxwt
agirmljvlhedbsyoqkzuknpxjt
agirmcjvchedbsyoqfzmknyxwt
agirmcjvlhedbsyovfzuynpxwl
agtrmcjvlhedysyoqfzuknexwt
agirmcjvmhedbslonfzuknpxwt
agirmcjfshedbsyoqfziknpxwt
agirmcjvlhedbsygqfzkknpbwt
agyrmcivlhedbsyovfzuknpxwt
agirmcjvghedbsyoqjzuknkxwt
agirmcjvlhedqsyoqfzukspxmt
ayirmcjvhhedbsyomfzuknpxwt
agirmcjvlnembsypqfzuknpxwt
agirmcjqlhedbsyuvfzuknpxwt
agirmcjvlhembsybqfzuknpxwa
agirjcfvlhedbsyoqfuuknpxwt
agirmcjvohedbsyowfzuknxxwt
agirmcjvlhedroyoqfzukncxwt
agrrmijvlhedbsyoqfnuknpxwt
agirmjjvlhsdbsyoqfzumnpxwt
agirrcjvnhedbsyoqfzuktpxwt
agirmcjvlzedjsyoqfzuknpdwt
agirmkjvlhedbsyoqfzxinpxwt
agirmcjvlhedbzyojfzuknpvwt
arirmcjvlheddsyoqfzuknrxwt
agirmcjvlhedbsyoqhzuanpxmt
agirmcjvluedbsyoqozuknwxwt
afirmcjwlhedxsyoqfzuknpxwt
agirmcjvlhefbsyoqfkuinpxwt
agirycjvltedbsypqfzuknpxwt
agirmrxvlhedbsyoqfzeknpxwt
agfrmcqvlhedbsyoqxzuknpxwt
agormcjvuhexbsyoqfzuknpxwt
agyrmcjvehddbsyoqfzuknpxwt
agirmcjvlheqbsynqfzgknpxwt
agirmcjvlhedbsloufwuknpxwt
tgirmcjvlwedbsyoqfzuknpqwt
agirmcjvlhesbzyogfzuknpxwt
agitmdjvlhedpsyoqfzuknpjwt
bgirmejvlhtdbsyoqfzuknpxwt
aginmcjvlhedzsyoqfzuknoxwt
agvrzcjvlhedbsuoqfzuknpxwt
agormcjvlhedbsyoqfzuknpodt
agirmcevlhedbgyojfzuknpxwt
agirmcjblhedboytqfzuknpxwt
qgibmcjvlhedbsyoqfzuknbxwt
agirmcjvlhedbsyoafzutnnxwt
agiamcjvchkdbsyoqfzuknpxwt
agirmcjvehedblyoqwzuknpxwt
agirmcpvlhwdbsyoafzuknpxwt
agirmcjvlhtdbsyoqfzumnpxtt
agirmcjalhegtsyoqfzuknpxwt
agirdijvlhedbsyoqfzutnpxwt
agirmckvlhgdbsyovfzuknpxwt
qgmrmcjvlkedbsyoqfzuknpxwt
agirjcjvlhodbsyoqfzuanpxwt
ajirmcjvlhedbpyoqftuknpxwt
cgirmcjvlhedbsyoqfiuonpxwt
ayirmcjvlhedbsyaqfzuknwxwt
agirmcjvlhedbdyoqbzwknpxwt
2018/day03/input.txt
-1399
View File
File diff suppressed because it is too large Load Diff
2018/day04/input.txt
-1098
View File
File diff suppressed because it is too large Load Diff
2018/day05/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2018/day06/input.txt
-50
View File
@@ -1,50 +0,0 @@
275, 276
176, 108
270, 134
192, 224
252, 104
240, 271
144, 220
341, 303
344, 166
142, 347
207, 135
142, 353
343, 74
90, 210
82, 236
124, 295
41, 226
298, 109
276, 314
50, 303
131, 42
119, 335
275, 125
113, 289
347, 230
192, 329
158, 316
154, 356
171, 350
165, 59
257, 129
306, 55
334, 203
55, 63
268, 198
44, 103
230, 199
41, 181
357, 328
331, 85
256, 290
168, 290
353, 77
81, 328
136, 316
138, 213
352, 271
139, 222
139, 318
194, 239
2018/day07/input.txt
-101
View File
@@ -1,101 +0,0 @@
Step Z must be finished before step V can begin.
Step V must be finished before step K can begin.
Step M must be finished before step Q can begin.
Step E must be finished before step X can begin.
Step J must be finished before step W can begin.
Step L must be finished before step O can begin.
Step Q must be finished before step T can begin.
Step Y must be finished before step P can begin.
Step X must be finished before step R can begin.
Step T must be finished before step U can begin.
Step I must be finished before step O can begin.
Step P must be finished before step H can begin.
Step G must be finished before step A can begin.
Step N must be finished before step A can begin.
Step H must be finished before step B can begin.
Step F must be finished before step D can begin.
Step S must be finished before step O can begin.
Step O must be finished before step W can begin.
Step D must be finished before step U can begin.
Step W must be finished before step B can begin.
Step A must be finished before step K can begin.
Step B must be finished before step R can begin.
Step K must be finished before step C can begin.
Step R must be finished before step C can begin.
Step U must be finished before step C can begin.
Step A must be finished before step U can begin.
Step J must be finished before step I can begin.
Step D must be finished before step K can begin.
Step V must be finished before step S can begin.
Step H must be finished before step C can begin.
Step R must be finished before step U can begin.
Step I must be finished before step G can begin.
Step D must be finished before step R can begin.
Step M must be finished before step B can begin.
Step G must be finished before step R can begin.
Step M must be finished before step I can begin.
Step G must be finished before step N can begin.
Step M must be finished before step N can begin.
Step Q must be finished before step S can begin.
Step I must be finished before step S can begin.
Step J must be finished before step R can begin.
Step O must be finished before step B can begin.
Step G must be finished before step S can begin.
Step J must be finished before step C can begin.
Step M must be finished before step D can begin.
Step T must be finished before step H can begin.
Step P must be finished before step N can begin.
Step S must be finished before step K can begin.
Step T must be finished before step C can begin.
Step J must be finished before step A can begin.
Step G must be finished before step F can begin.
Step N must be finished before step R can begin.
Step N must be finished before step W can begin.
Step T must be finished before step I can begin.
Step S must be finished before step B can begin.
Step H must be finished before step F can begin.
Step B must be finished before step C can begin.
Step L must be finished before step W can begin.
Step N must be finished before step O can begin.
Step O must be finished before step A can begin.
Step H must be finished before step S can begin.
Step F must be finished before step A can begin.
Step F must be finished before step C can begin.
Step M must be finished before step A can begin.
Step Z must be finished before step H can begin.
Step Z must be finished before step L can begin.
Step E must be finished before step H can begin.
Step X must be finished before step T can begin.
Step Y must be finished before step X can begin.
Step E must be finished before step W can begin.
Step P must be finished before step R can begin.
Step Z must be finished before step E can begin.
Step W must be finished before step C can begin.
Step I must be finished before step P can begin.
Step X must be finished before step A can begin.
Step Y must be finished before step C can begin.
Step I must be finished before step F can begin.
Step L must be finished before step T can begin.
Step A must be finished before step B can begin.
Step F must be finished before step W can begin.
Step T must be finished before step R can begin.
Step X must be finished before step F can begin.
Step M must be finished before step O can begin.
Step N must be finished before step K can begin.
Step T must be finished before step S can begin.
Step J must be finished before step N can begin.
Step J must be finished before step S can begin.
Step O must be finished before step D can begin.
Step T must be finished before step P can begin.
Step Z must be finished before step D can begin.
Step L must be finished before step X can begin.
Step Q must be finished before step G can begin.
Step M must be finished before step G can begin.
Step P must be finished before step W can begin.
Step V must be finished before step P can begin.
Step D must be finished before step B can begin.
Step Y must be finished before step D can begin.
Step X must be finished before step S can begin.
Step K must be finished before step U can begin.
Step Z must be finished before step Y can begin.
Step D must be finished before step W can begin.
2018/day08/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2018/day09/input.txt
-1
View File
@@ -1 +0,0 @@
448 players; last marble is worth 71628 points
2018/day10/input.txt
-366
View File
@@ -1,366 +0,0 @@
position=< 50200, 10144> velocity=<-5, -1>
position=< -9855, -9873> velocity=< 1, 1>
position=<-29840, 30163> velocity=< 3, -3>
position=< 50213, 30162> velocity=<-5, -3>
position=< 20168, 20161> velocity=<-2, -2>
position=< 20147, 10144> velocity=<-2, -1>
position=< 30166, -39894> velocity=<-3, 4>
position=< -9863, 20157> velocity=< 1, -2>
position=< 20176, 50185> velocity=<-2, -5>
position=< 40210, -9867> velocity=<-4, 1>
position=< 40178, -29887> velocity=<-4, 3>
position=< -9840, 40171> velocity=< 1, -4>
position=<-29893, -9868> velocity=< 3, 1>
position=< 20149, -39901> velocity=<-2, 4>
position=< 30185, 40179> velocity=<-3, -4>
position=< 50171, 10147> velocity=<-5, -1>
position=< 50232, -29885> velocity=<-5, 3>
position=< 10151, 10150> velocity=<-1, -1>
position=< 30205, 30167> velocity=<-3, -3>
position=<-49871, 20158> velocity=< 5, -2>
position=< -9859, -9865> velocity=< 1, 1>
position=< 10151, -19882> velocity=<-1, 2>
position=< -9843, 10144> velocity=< 1, -1>
position=< -9825, -9865> velocity=< 1, 1>
position=< 10170, 20162> velocity=<-1, -2>
position=<-49917, 40171> velocity=< 5, -4>
position=< 40164, 40171> velocity=<-4, -4>
position=< 30198, 40171> velocity=<-3, -4>
position=< 50179, -49909> velocity=<-5, 5>
position=< 40199, -9865> velocity=<-4, 1>
position=< 10193, -39901> velocity=<-1, 4>
position=<-29880, -29886> velocity=< 3, 3>
position=< 30193, -29890> velocity=<-3, 3>
position=< -9857, 30168> velocity=< 1, -3>
position=<-29893, -29887> velocity=< 3, 3>
position=< -9843, 20159> velocity=< 1, -2>
position=< 10176, 50180> velocity=<-1, -5>
position=< 50172, -19883> velocity=<-5, 2>
position=< 40218, -29884> velocity=<-4, 3>
position=<-49911, -9870> velocity=< 5, 1>
position=<-19852, 40180> velocity=< 2, -4>
position=< -9883, -19876> velocity=< 1, 2>
position=<-29901, 30166> velocity=< 3, -3>
position=< 20160, 30171> velocity=<-2, -3>
position=< 50171, -19880> velocity=<-5, 2>
position=< 10148, -9866> velocity=<-1, 1>
position=< 20197, -49901> velocity=<-2, 5>
position=<-49895, -49902> velocity=< 5, 5>
position=< 50211, 30166> velocity=<-5, -3>
position=< 30211, 10144> velocity=<-3, -1>
position=<-19868, -39895> velocity=< 2, 4>
position=<-39867, -9870> velocity=< 4, 1>
position=<-49911, 30168> velocity=< 5, -3>
position=< 50179, 50187> velocity=<-5, -5>
position=< 50219, -29887> velocity=<-5, 3>
position=<-49895, -9874> velocity=< 5, 1>
position=< 20145, -29888> velocity=<-2, 3>
position=< 10156, 30163> velocity=<-1, -3>
position=< 20176, -49910> velocity=<-2, 5>
position=<-49863, -49902> velocity=< 5, 5>
position=<-39850, 30170> velocity=< 4, -3>
position=< 50214, -19879> velocity=<-5, 2>
position=<-19882, 30162> velocity=< 2, -3>
position=< 10160, -19878> velocity=<-1, 2>
position=< 20168, 40180> velocity=<-2, -4>
position=< 50195, 50185> velocity=<-5, -5>
position=< -9858, -9870> velocity=< 1, 1>
position=< 50187, 10153> velocity=<-5, -1>
position=<-49919, -19877> velocity=< 5, 2>
position=< 30209, 10151> velocity=<-3, -1>
position=<-49879, 20159> velocity=< 5, -2>
position=<-39902, 30171> velocity=< 4, -3>
position=< 30166, 50182> velocity=<-3, -5>
position=< -9855, 50188> velocity=< 1, -5>
position=<-39849, 50185> velocity=< 4, -5>
position=<-19884, -19880> velocity=< 2, 2>
position=<-39902, -49902> velocity=< 4, 5>
position=< 50171, -29892> velocity=<-5, 3>
position=< -9883, -39892> velocity=< 1, 4>
position=<-19850, 50184> velocity=< 2, -5>
position=<-19892, -19878> velocity=< 2, 2>
position=<-39870, -39894> velocity=< 4, 4>
position=<-39870, 40174> velocity=< 4, -4>
position=< 30196, 50189> velocity=<-3, -5>
position=<-49874, -29883> velocity=< 5, 3>
position=<-19888, 50180> velocity=< 2, -5>
position=<-49858, 10152> velocity=< 5, -1>
position=< 50192, -49905> velocity=<-5, 5>
position=<-49907, 50184> velocity=< 5, -5>
position=< 50184, 20160> velocity=<-5, -2>
position=< -9830, -19876> velocity=< 1, 2>
position=< 10159, 40172> velocity=<-1, -4>
position=< 20205, -9867> velocity=<-2, 1>
position=< 40211, -19878> velocity=<-4, 2>
position=< 20185, 10144> velocity=<-2, -1>
position=<-49875, -9865> velocity=< 5, 1>
position=< 10176, 30166> velocity=<-1, -3>
position=<-19836, 10150> velocity=< 2, -1>
position=<-19879, -29889> velocity=< 2, 3>
position=< 10183, -49905> velocity=<-1, 5>
position=< 20165, 10148> velocity=<-2, -1>
position=< 50171, -49909> velocity=<-5, 5>
position=< 30185, 20158> velocity=<-3, -2>
position=<-49915, 10148> velocity=< 5, -1>
position=<-39859, 10144> velocity=< 4, -1>
position=< 50195, -49904> velocity=<-5, 5>
position=< 40218, -39899> velocity=<-4, 4>
position=< 50183, -9874> velocity=<-5, 1>
position=< 20204, -39901> velocity=<-2, 4>
position=< 50195, -29891> velocity=<-5, 3>
position=<-39902, 20162> velocity=< 4, -2>
position=< 20152, 30162> velocity=<-2, -3>
position=<-39894, -39895> velocity=< 4, 4>
position=<-19841, -19878> velocity=< 2, 2>
position=<-19848, 30171> velocity=< 2, -3>
position=< -9870, 30168> velocity=< 1, -3>
position=< 40179, -19879> velocity=<-4, 2>
position=<-49910, -39892> velocity=< 5, 4>
position=< 10146, -9870> velocity=<-1, 1>
position=< 20197, -49902> velocity=<-2, 5>
position=<-19839, 40179> velocity=< 2, -4>
position=<-49898, -29883> velocity=< 5, 3>
position=< 20147, 20157> velocity=<-2, -2>
position=< 20176, -49905> velocity=<-2, 5>
position=< 10148, -19881> velocity=<-1, 2>
position=< 20152, 40173> velocity=<-2, -4>
position=< 20144, 20155> velocity=<-2, -2>
position=<-49858, 10151> velocity=< 5, -1>
position=< -9842, 20157> velocity=< 1, -2>
position=< 50227, 50185> velocity=<-5, -5>
position=<-29877, 50181> velocity=< 3, -5>
position=< 50203, 50189> velocity=<-5, -5>
position=< -9870, 10145> velocity=< 1, -1>
position=< -9872, 20157> velocity=< 1, -2>
position=< 20200, 40176> velocity=<-2, -4>
position=< 50227, 50182> velocity=<-5, -5>
position=< -9862, 50187> velocity=< 1, -5>
position=<-29857, 40171> velocity=< 3, -4>
position=< 30201, 40174> velocity=<-3, -4>
position=<-29900, -39897> velocity=< 3, 4>
position=<-39868, -9870> velocity=< 4, 1>
position=<-39854, -19882> velocity=< 4, 2>
position=<-29896, 10144> velocity=< 3, -1>
position=< 20168, 50183> velocity=<-2, -5>
position=< 20184, -19875> velocity=<-2, 2>
position=< -9882, -9874> velocity=< 1, 1>
position=<-29885, -39894> velocity=< 3, 4>
position=< 20184, -49901> velocity=<-2, 5>
position=<-39910, 10150> velocity=< 4, -1>
position=<-29842, -9865> velocity=< 3, 1>
position=< 10195, 40171> velocity=<-1, -4>
position=< 50187, 40174> velocity=<-5, -4>
position=< 20192, -9865> velocity=<-2, 1>
position=< -9839, -29883> velocity=< 1, 3>
position=< 10194, 20158> velocity=<-1, -2>
position=< -9827, 20160> velocity=< 1, -2>
position=<-49914, -29892> velocity=< 5, 3>
position=< 10170, 20162> velocity=<-1, -2>
position=< 10151, 40172> velocity=<-1, -4>
position=< -9846, -39892> velocity=< 1, 4>
position=< 20176, 40173> velocity=<-2, -4>
position=<-29885, 50182> velocity=< 3, -5>
position=< 10193, 30162> velocity=<-1, -3>
position=< 20160, -29884> velocity=<-2, 3>
position=<-19874, -49906> velocity=< 2, 5>
position=< -9830, 50188> velocity=< 1, -5>
position=< 20176, -9868> velocity=<-2, 1>
position=< 50211, 40176> velocity=<-5, -4>
position=<-29869, -29891> velocity=< 3, 3>
position=<-29861, 30168> velocity=< 3, -3>
position=< 50195, 50188> velocity=<-5, -5>
position=<-49903, -19882> velocity=< 5, 2>
position=<-49916, -9870> velocity=< 5, 1>
position=< 30201, -29889> velocity=<-3, 3>
position=< -9875, 50181> velocity=< 1, -5>
position=<-39910, 30170> velocity=< 4, -3>
position=< 50211, -29892> velocity=<-5, 3>
position=< 50219, 50183> velocity=<-5, -5>
position=< -9873, 40175> velocity=< 1, -4>
position=< -9855, -29891> velocity=< 1, 3>
position=<-29861, 20160> velocity=< 3, -2>
position=<-39894, 20157> velocity=< 4, -2>
position=< 30153, -29886> velocity=<-3, 3>
position=< 20171, -9867> velocity=<-2, 1>
position=< 20176, -9867> velocity=<-2, 1>
position=<-39870, -39899> velocity=< 4, 4>
position=< 30198, -29892> velocity=<-3, 3>
position=< -9854, -49901> velocity=< 1, 5>
position=< 10139, -49910> velocity=<-1, 5>
position=< -9830, -19880> velocity=< 1, 2>
position=< -9830, -39894> velocity=< 1, 4>
position=<-29880, 30162> velocity=< 3, -3>
position=< -9875, -19876> velocity=< 1, 2>
position=< 10195, -19875> velocity=<-1, 2>
position=<-29892, 40171> velocity=< 3, -4>
position=<-29893, -19883> velocity=< 3, 2>
position=< 20176, -19875> velocity=<-2, 2>
position=<-29844, -19883> velocity=< 3, 2>
position=<-29859, 10144> velocity=< 3, -1>
position=< 40211, -29887> velocity=<-4, 3>
position=<-49871, 10151> velocity=< 5, -1>
position=< 20157, -39894> velocity=<-2, 4>
position=< 30185, -9865> velocity=<-3, 1>
position=< 30196, -29892> velocity=<-3, 3>
position=< 20197, 40175> velocity=<-2, -4>
position=<-19850, 20162> velocity=< 2, -2>
position=< 30153, -9874> velocity=<-3, 1>
position=< 30153, 10148> velocity=<-3, -1>
position=<-39862, -49902> velocity=< 4, 5>
position=< 50203, -19879> velocity=<-5, 2>
position=<-39883, -39899> velocity=< 4, 4>
position=< -9862, -19880> velocity=< 1, 2>
position=< 20204, 50180> velocity=<-2, -5>
position=< 30195, -49906> velocity=<-3, 5>
position=< 10167, 10150> velocity=<-1, -1>
position=<-29865, -49901> velocity=< 3, 5>
position=< 30164, -39892> velocity=<-3, 4>
position=< -9835, -49908> velocity=< 1, 5>
position=<-19871, -19882> velocity=< 2, 2>
position=<-29853, 30168> velocity=< 3, -3>
position=<-19868, 20157> velocity=< 2, -2>
position=< 50195, -19881> velocity=<-5, 2>
position=< 40170, -49904> velocity=<-4, 5>
position=<-19851, -49910> velocity=< 2, 5>
position=< -9862, 30164> velocity=< 1, -3>
position=< 50171, -9872> velocity=<-5, 1>
position=<-39869, -19874> velocity=< 4, 2>
position=< 30180, 20155> velocity=<-3, -2>
position=< 10188, 20157> velocity=<-1, -2>
position=< 10191, -9867> velocity=<-1, 1>
position=<-29845, 10152> velocity=< 3, -1>
position=<-19889, -39901> velocity=< 2, 4>
position=< 40170, 20153> velocity=<-4, -2>
position=< 30177, 10150> velocity=<-3, -1>
position=< 30185, 20157> velocity=<-3, -2>
position=< 40206, 10144> velocity=<-4, -1>
position=<-39894, 50180> velocity=< 4, -5>
position=<-19892, 10146> velocity=< 2, -1>
position=<-39854, 10150> velocity=< 4, -1>
position=<-39889, 10151> velocity=< 4, -1>
position=< 10188, -39895> velocity=<-1, 4>
position=< 30196, 20162> velocity=<-3, -2>
position=< 10178, -29892> velocity=<-1, 3>
position=< 20184, 40178> velocity=<-2, -4>
position=< 20153, -49901> velocity=<-2, 5>
position=< 30165, 10153> velocity=<-3, -1>
position=<-49861, 30171> velocity=< 5, -3>
position=< 40186, 10149> velocity=<-4, -1>
position=<-49903, 20156> velocity=< 5, -2>
position=< 40179, 10148> velocity=<-4, -1>
position=< -9859, -19879> velocity=< 1, 2>
position=< -9827, -19880> velocity=< 1, 2>
position=<-39894, 10146> velocity=< 4, -1>
position=< 40178, 10146> velocity=<-4, -1>
position=<-19842, 10149> velocity=< 2, -1>
position=< 20192, -29884> velocity=<-2, 3>
position=<-19884, -39897> velocity=< 2, 4>
position=< 40162, 30163> velocity=<-4, -3>
position=< 50192, 40173> velocity=<-5, -4>
position=< 50173, -49906> velocity=<-5, 5>
position=< 40178, -49906> velocity=<-4, 5>
position=< 20205, -29887> velocity=<-2, 3>
position=< 30193, 10149> velocity=<-3, -1>
position=<-49871, -29886> velocity=< 5, 3>
position=<-39910, 20156> velocity=< 4, -2>
position=< -9862, -9867> velocity=< 1, 1>
position=<-19860, -49904> velocity=< 2, 5>
position=< 20176, -19883> velocity=<-2, 2>
position=< -9862, 50189> velocity=< 1, -5>
position=<-49895, 30166> velocity=< 5, -3>
position=< -9875, -29885> velocity=< 1, 3>
position=< 20184, -9873> velocity=<-2, 1>
position=<-49919, 10144> velocity=< 5, -1>
position=< -9870, 40172> velocity=< 1, -4>
position=<-49866, 30166> velocity=< 5, -3>
position=< 30165, -29888> velocity=<-3, 3>
position=<-19864, -9866> velocity=< 2, 1>
position=< 20187, 20162> velocity=<-2, -2>
position=< 20172, -29884> velocity=<-2, 3>
position=<-19876, -19879> velocity=< 2, 2>
position=< 30197, -49910> velocity=<-3, 5>
position=< 10168, -29883> velocity=<-1, 3>
position=< 10160, -19878> velocity=<-1, 2>
position=<-29893, -39892> velocity=< 3, 4>
position=<-19883, -19879> velocity=< 2, 2>
position=<-29842, 20153> velocity=< 3, -2>
position=<-39878, 30165> velocity=< 4, -3>
position=< 40223, -19874> velocity=<-4, 2>
position=<-49911, 20155> velocity=< 5, -2>
position=<-49859, -19878> velocity=< 5, 2>
position=< 50200, 10153> velocity=<-5, -1>
position=< 10145, -49910> velocity=<-1, 5>
position=< 20197, 30168> velocity=<-2, -3>
position=<-19892, -29887> velocity=< 2, 3>
position=< 10167, 30166> velocity=<-1, -3>
position=<-49903, 30168> velocity=< 5, -3>
position=< -9864, -9870> velocity=< 1, 1>
position=<-19833, 40180> velocity=< 2, -4>
position=< 50219, 50189> velocity=<-5, -5>
position=< 20197, 10153> velocity=<-2, -1>
position=<-39858, 50185> velocity=< 4, -5>
position=< 50204, -39892> velocity=<-5, 4>
position=< 40215, -49905> velocity=<-4, 5>
position=< 20168, 50180> velocity=<-2, -5>
position=<-29880, 40173> velocity=< 3, -4>
position=< -9864, 40175> velocity=< 1, -4>
position=<-39862, 10153> velocity=< 4, -1>
position=< -9854, -9865> velocity=< 1, 1>
position=<-29880, -49907> velocity=< 3, 5>
position=< -9879, -19879> velocity=< 1, 2>
position=< 50228, 10153> velocity=<-5, -1>
position=< 50187, 50183> velocity=<-5, -5>
position=< -9843, -19874> velocity=< 1, 2>
position=< 30206, 40178> velocity=<-3, -4>
position=<-29867, -49901> velocity=< 3, 5>
position=< 40165, -19879> velocity=<-4, 2>
position=< 20200, 20157> velocity=<-2, -2>
position=< -9859, 10151> velocity=< 1, -1>
position=< 20155, -39897> velocity=<-2, 4>
position=< 30154, -39901> velocity=<-3, 4>
position=< 50207, -49901> velocity=<-5, 5>
position=<-29841, -49902> velocity=< 3, 5>
position=<-39889, 20158> velocity=< 4, -2>
position=< 40173, 30162> velocity=<-4, -3>
position=< 30177, 50187> velocity=<-3, -5>
position=< 40183, 40179> velocity=<-4, -4>
position=< 40219, -29883> velocity=<-4, 3>
position=< 40182, -9870> velocity=<-4, 1>
position=< -9843, 40179> velocity=< 1, -4>
position=<-39866, 30166> velocity=< 4, -3>
position=< -9867, -49910> velocity=< 1, 5>
position=<-39877, 50189> velocity=< 4, -5>
position=<-49879, -9870> velocity=< 5, 1>
position=< 50224, -29890> velocity=<-5, 3>
position=< 40172, -49901> velocity=<-4, 5>
position=< 10151, -39893> velocity=<-1, 4>
position=< 20193, 10145> velocity=<-2, -1>
position=< 40223, -9868> velocity=<-4, 1>
position=<-49911, -19875> velocity=< 5, 2>
position=< 30174, 10144> velocity=<-3, -1>
position=< 20154, -29883> velocity=<-2, 3>
position=<-19844, 30168> velocity=< 2, -3>
position=<-19865, -49908> velocity=< 2, 5>
position=<-19843, -49909> velocity=< 2, 5>
position=< 50171, -49909> velocity=<-5, 5>
position=< 30210, 40180> velocity=<-3, -4>
position=< -9880, 50180> velocity=< 1, -5>
position=<-39870, -19875> velocity=< 4, 2>
position=< -9835, 10148> velocity=< 1, -1>
position=<-39862, -29888> velocity=< 4, 3>
position=< -9833, 30162> velocity=< 1, -3>
position=<-39852, -19874> velocity=< 4, 2>
position=<-39909, -19879> velocity=< 4, 2>
position=<-49903, 40178> velocity=< 5, -4>
position=< -9848, 50189> velocity=< 1, -5>
position=< -9831, -29891> velocity=< 1, 3>
position=<-19880, -39892> velocity=< 2, 4>
position=< 50216, -49910> velocity=<-5, 5>
position=< 50197, -39898> velocity=<-5, 4>
position=<-39897, 50185> velocity=< 4, -5>
position=< -9867, -49902> velocity=< 1, 5>
position=< 30162, -19874> velocity=<-3, 2>
position=<-19875, 40175> velocity=< 2, -4>
position=< 10156, -19878> velocity=<-1, 2>
position=< -9871, -49906> velocity=< 1, 5>
position=<-19880, 30162> velocity=< 2, -3>
2018/day11/input.txt
-1
View File
@@ -1 +0,0 @@
7400
2018/day12/input.txt
-34
View File
@@ -1,34 +0,0 @@
initial state: ..##.#######...##.###...#..#.#.#..#.##.#.##....####..........#..#.######..####.#.#..###.##..##..#..#
#..#. => .
..#.. => .
..#.# => #
##.#. => .
.#... => #
#.... => .
##### => #
.#.## => .
#.#.. => .
#.### => #
.##.. => #
##... => .
#...# => #
####. => #
#.#.# => .
#..## => .
.#### => .
...## => .
..### => #
.#..# => .
##..# => #
.#.#. => .
..##. => .
###.. => .
###.# => #
#.##. => #
..... => .
.##.# => #
....# => .
##.## => #
...#. => #
.###. => .
2018/day13/input.txt
-150
View File
@@ -1,150 +0,0 @@
/-----------------\ /--------------------------------------------------------------------------------\
/----+----------\ | /----------------+-------------------------------------------------------------------\ |
| | /-----+---\ | | /--------------+->-----------------------------------------------------------\ | |
/+----+----+-----+---+--+--+-+--------------+-----------------------\ /----<-------------------\ | | |
/------------------++----+----+-----+---+--+--+-+------------\ | /----------------+-------+------------------------+----+-----+--\ |
| || | | | | | | | | |/-----+----------------+-------+--------------\ | | | | |
| || | | | | | | | | || v /---------+-------+--------------+---------+----+-----+--+--\ |
| || | | | /+--+--+-+--------\ | || | | | /-----+-------\ /---+---------+----+-----+-\| | |
| /--++----+----+-----+--++--+--+-+--------+---+-++-----+------+---------+-+---\ | | | | | | | || | |
| /--------+--++----+----+-----+--++--+--+-+--------+---+-++-----+-----\| /+-+---+-+-------+--+---+---------+----+-----+-++--+------+\
| | /------+--++----+----+-----+--++--+--+-+--------+---+-++----<+-----++--------++-+---+-+-\ | | | | | | || | ||
| | | | || | | | || | /+-+--------+---+-++-----+-----++--------++-+---+-+-+-----+--+---+---------+----+-----+-++--+----\ ||
| /--+-+------+--++----+----+-----+--++-\| || | | | || | || || | | | | | | | | | | || | | ||
| | | | | || | | | || || || | | | || | /-++--------++-+---+-+-+-----+--+---+-\ |/---+-----+\|| | | ||
| | | | /+--++----+----+-----+--++-++-++-+-------\| | ||/----+---+-++--------++-+---+-+-+-----+--+---+-+-------++---+-----++++--+\ | ||
|/--+--+-+-----++--++----+----+-----+--++-++-++-+-------++---+-+++----+---+\|| || | | | | | | | | || | |||| || | ||
|| | | | || || | \-----+--+/ || || | || | ||| | |||| || | | | | | | | | || | |||| || | ||
|| | | |/----++--++----+----------+--+--++-++-+-------++---+-+++----+---++++--------++-+->-+-+-+-----+--+---+-+-----\ || | |||| || | ||
|| | | || || || | | | || |\-+-------++---+-+++----+---++++--------++-+---+-+-+-----+--+---+-+-----+-++---+-----/||| || | ||
/++--+--+-++--\ || || | | | || | | || | ||| | |||| || | | | | | | | | | || | ||| || | ||
||| | | || | || || | | \--++-+--+-------+/ | ||| | |||| || | | | | | | | | | || | ||| || | ||
||| | | || | || || | | || | | | | ||| | |||| /------++-+---+-+-+-----+--+---+-+-----+-++---+-----\||| || | ||
||| | | || | || || | | || | | | | ||| | |||| |/-----++-+---+-+-+-----+--+---+-+-----+-++---+-\ |||| || | ||
||| | | || | || || /--+----------+-----++-+--+-------+----+-+++----+---++++\|| || | | | | | | | | | || | | |||| || | ||
||| | | || | || || | | | || | | | | ||| | |||\+++-----++-+---+-+-+-----+--+---+-+-----+-++---+-+---++++--/| | ||
||| | | || | || || | | | || | /+---->--+---\| ||| | ||| ||| /++-+---+-+-+-----+--+---+-+-----+-++---+-+\ |||| | | ||
||| | |/++--+-++--++-+--+----------+-----++-+-++-------+---++-+++----+---+++-+++----+++-+---+-+-+-----+--+---+-+---\ | || | || |||| | | ||
||| | |||| | || || | | /-----+-----++-+-++-------+---++-+++----+---+++-+++----+++-+---+-+-+-----+--+-\ | | | | || | || |||| | | ||
||| | |||| | || || | | | | || | || | || |\+----+---+++-+++----+++-+---+-+-+-----+--+-+-/ | |/+-++---+-++--++++---+---+-++\
||| | ||\+--+-++--++-+--+----+-----+-----++-+-++-------+---++-+-+----+---+++-+++----+++-+---+-+-/ | | | | ||| || | || |||| | | |||
/+++--+--++-+--+-++--++-+--+----+-----+-----++-+-++-------+---++-+-+----+---+++-+++----+++-+--\| | | | | | ||| || | || |||| | | |||
|||| | || | | || || | | | | || | || | || | | | ||| ||| ||| \--++-+-------/ | | | ||| || | || |||| | | |||
|||| | /++-+--+-++--++-+--+----+-----+-\ || | || /---+---++-+-+----+---+++-+++----+++----++-+----------+-+---+---+++-++---+\|| |||| | | |||
|||| /+-+++-+--+-++--++-+--+----+-----+-+---++-+-++---+---+---++-+-+----+---+++-+++----+++----++-+---\ | | | ||| || |||| |||| | | |||
|||| || ||| | | || || | | /-+-----+-+---++-+-++---+---+---++-+-+--\ | ||| ||| |\+----++-+---+------+-+---+---+++-++---++++--++++---+---+-+/|
|||| || ||| | v || |\-+--+--+-+-----/ | || | || | /-+---++-+-+--+-+---+++-+++-\ | | || | | | | | ||| || |||| |||| | | | |
|||| || ||| | |/++--+--+--+--+-+-------+---++-+-++---+-+-+---++-+-+--+-+---+++-+++-+--+-+----++-+---+------+-+-\ | ||| || |||| |||| | | | |
|||| || ||| | |||| | | | | | | || | || | | | || | | | | ||| |\+-+--+-+----++-+---+------+-+-+-+---+++-++---++++--/||| | | | |
|||| || |||/+--++++--+--+--+--+-+-------+---++-+-++---+-+-+---++-+-+--+-+---+++-+-+-+--+-+----++-+---+------+-+-+-+-\ ||| || |||| ||| | | | |
|||| || ||||| |||| | /+--+--+-+-----\ | || | || | | | || | | | | ||| | | | \-+----++-+---+------+-+-+-+-+-+++-++---+++/ ||| | | | |
|||| || ||||| |||| | || | | | |/+---++-+-++---+-+-+---++-+-+--+-+---+++-+-+-+----+----++-+---+------+\| | | | ||| || ||| ||| | | | |
|||| || ||||| |||| |/++--+--+-+-----+++---++-+-++---+-+-+---++-+-+--+-+---+++-+-+-+---\| || | | ||| | | | ||| || ||| ||| | | | |
|||| || ||||| |||| |||| | | | ||| || | ||/--+-+-+---++-+-+--+-+---+++-+-+-+---++----++-+---+------+++-+-+-+-+++-++---+++----+++---+--\| | |
||||/++-+++++--++++--++++--+--+-+-----+++---++-+-+++--+-+-+---++-+-+--+-+---+++-+-+-+---++\ || | | ||| | | | ||| || ||| ||| | || | |
||||||| ||||| |||\--++++--+--+-+-----+++---++-+-+++--+-+-+---++-+-+--+-+---+++-+-+-+---+++---+/ | | ||| | | | ||| || ||| ||| | || | |
||||||| ||||| ||| /-++++--+--+-+-----+++---++-+-+++-\| | | || | | | | |||/+-+-+---+++---+--+---+------+++-+-+-+-+++-++---+++----+++-\ | || | |
||||||| ||||| ||| | ||||/-+--+-+-----+++---++-+-+++-++-+-+---++-+-+--+-+---+++++-+-+---+++---+--+---+------+++-+-+-+-+++-++-\ ||| ||| | | || | |
\++++++-+++++--+++-+-+++++-+--+-+-----+++---++-+-+++-++-+-+---++-+-+--+-+---+++++-+-+---+++---/ | | ||| | | | ||| || | ||| ||| | | || ^ |
|||||| ||||| ||| | ||||| | | | ||| || | ||| || | | || | |/-+-+---+++++-+-+---+++------+---+------+++-+-+-+-+++-++-+-+++----+++-+-+--++\| |
|||||| ||||| ||| | ||||| | | | ||| || | ||| || | |/--++-+-++-+-+---+++++-+-+---+++------+-\ | \++-+-+-+-+++-++-+-+++----+/| | | |||| |
|||||| ||||| ||| | ||||| | | | ||| || | ||| || | || || | || | | ||||| | |/--+++------+-+-+-------++-+-+-+-+++-++-+-+++-\ | | | | |||| |
||\+++-+++++--+++-+-+++++-+--+-+-----+++---++-+-+++-++-+-++--++-+-++-+-+---+/||| | || ||| | | | || | | | ||| ||/+-+++-+--+-+-+-+--++++\|
|| ||| ||||| ||| | ||||| | | | ||| || | ||| || | ||/-++-+-++-+-+\ | ||| | ^| ||| | | | /-----++-+-+-+-+++-++++-+++-+--+-+-+-+-\||||||
|| |||/+++++--+++-+-+++++-+--+-+-----+++---++-+-+++-++-+-+++-++-+-++-+-++--+-+++-+-++--+++------+-+-+\| || | | | ||| |||| ||| | | | | | |||||||
|| ||||||||| ||| | ||||| | | | ||| || | ||| || | ||| || \-++-+-++--+-+++-+-++--+++------+-+-+++-----++-+-+-+-+++-++++-+++-+--+-+-+-+-++++/||
/-++-+++++++++--+++-+-+++++-+--+-+-----+++---++-+-+++-++-+-+++-++---++-+-++--+-+++-+-++--+++------+\| ||| /--++-+-+-+-+++\|||| ||| | | | | | |||| ||
| || ||||||||| ||| | ||||| | | | ||| || | |||/++-+-+++-++---++-+-++--+-+++-+-++--+++------+++-+++--+-\|| | | | |||||||| ||| | | | | | |||| ||
| || ||||||||| ||| | ||||| | | | ||| ||/+-++++++-+-+++-++---++-+-++--+-+++\| || ||| ||| ||| | ||| | | | |||||||| ||| | | | | | |||| ||
| ||/+++++++++--+++-+\||||| \--+-+-----+++---+/|| \+++++-+-+++-/| || | || | ||||| || ||| ||| ||| | ||| | | | |||||||| ||| | | | | | |||| ||
| |||||||||||| ||| ||||||| /--+-+-----+++---+-++--+++++-+\||| | |^ | || | ||||| || ||| ||| ||| | ||| | | | |||||||| ||| | | | | | |||| ||
| |||||||||||| ||| ||||||| | | | ||| | || ||||| ||||| |/--++-+-++--+<+++++-++--+++------+++-+++--+-+++-+-+-+-++++++++-+++-+\ | | | | |||| ||
| |||||||||||| ||| ||||||| | | | ||| /+-++--+++++-+++++--++--++-+-++--+-+++++-++--+++------+++-+++-\| ||| | | | |||||||| ||| || | | | | |||| ||
| |||||||||||| ||| ||||||| | | | ||| || ||/-+++++-+++++--++--++-+-++--+-+++++-++-\||| ||| ||| || ||| | | | |||||||| ||| || | | | | |||| ||
| |||||||||||| |\+-+++++++-+--+-+-----+++--++-+++-+++++-+++++--++--++-+-++--+-+++++-++-++++------+++-+++-++-+++-/ | | |||||||| ||| || | | | | |||| ||
| |||||||||||\--+-+-+++++++-+--+-+-----+++--++-+++-+++++-+++++--++--++-+-++--+-+++++-++-++++------+++-+++-++-+++---+-+-++/||||| ||| || | | | | |||| ||
| ||||||||||| | | ||\++++-+--+-+-----+++--++-+++-+++++-+++++--++--++-+-++--+-+++++-++-++/| ||| ||| || ||| | | || ||||| ||| || | | | | |||| ||
| ||||||||||| | | || |||| | | | /-+++--++-+++-+++++-+++++--++--++-+-++--+-+++++-++-++-+------+++-+++-++-+++---+-+-++-+++++-+++-++-+\| | | |||| ||
| ||||||||||| | | || |||| | | | | ||| || ||| |\+++-+++++--++--++-+-++--+-+++++-++-++-+------+++-+++-++-+++---+-+-++-+++++-+++-++-+++-+-+-+/|| ||
| ||||||||||| /+-+-++-++++-+--+-+---+-+++--++-+++-+-+++-+++++--++--++-+-++--+-+++++-++-++-+--\ ||| ||| || ||| |/+-++-+++++-+++-++-+++-+-+-+\|| ||
| ||||||||||| || | || |||| | | | | ||| || ||| | ||| ||||| || || | || | ||||| || || | | ||| ||| || ||| ||| || ||||| ||| || ||| | | |||| ||
| ||||||||||| || | || |||| | | | | ||| || ||| | ||| ||||| || || | || | |\+++-++-++-+--+---+++-+++-++-+++---+++-++-+++++-+++-++-+++-/ | |||| ||
| ||||||||||| || |/++-++++-+--+-+---+-+++--++-+++-+-+++-+++++--++-\|| | || | | ||| || || | | \++-+++-++-+++---+++-++-+/||| ||| || ||| | |||| ||
| ||||||||||| || |||| |||| | \-+---+-+++--++-+++-+-+++-+++++--++-+++-/ || | | ||| || ||/+--+----++-+++-++-+++---+++-++-+-+++-+++-++-+++--\| |||| ||
| ||||||||||| || |||| |||| | | | ||| /++-+++-+-+++-+++++--++-+++---++--+-+-+++-++-++++--+----++-+++-++-+++---+++-++-+-+++-+++-++-+++--++\|||| ||
| ||||||||||| || |||| ||||/+----+---+-+++-+++-+++-+-+++-+++++--++-+++---++--+-+-+++-++-++++--+----++-+++\|| ||| ||| || | ||| ||| || ||| ||||||| ||
| ||||||||||| || |||| |\++++----+---+-/|| ||| ||| | ||| ||||| || ||| || | | ||| || |||| | || |||||| ||| ||| || | ||| ||| || ||| ||||||| ||
| ||||||||||| || |||| | |||| | | || ||| ||| | ||| ||||| /++-+++---++--+-+-+++-++\|||| | || |||||| ||| ||| || | ||| ||| || ||| ||||||| ||
| ||||||||||| || |||| | \+++----+---+--++-+++-+++-+-+++-+++++-+++-+++---++--+-+-/|| ||||||| | ||/++++++-+++\ ||| || | ||| ||| || ||| ||||||| ||
| ||||||||||| || |||| | ||| | | || ||| ||| | ||| ||||| ||| ||| || | | || ||||||| | ||||||||| |||| ||| || | ||| ||| || ||| ||||||| ||
| ||||||||||| || |||| | ||| | | || ||| ||| | ||| ||||| ||| ||| || | | || |||||||/-+----+++++++++-++++--+++-++-+-+++\||| || ||| ||||||| ||
| ||||||||||| || |||| | ||| | | || ||| ||| | ||| ||||| ||| ||| || | | || |||||||| | ||||||||| |||| ||| || | ||||||| || ||| ||||||| ||
| ||||||||||| || |||| | ||| | | || ||| ||| \-+++-+++++-+++-+++---++--+-+--++-++++++++-+----+++++++++-++++--+++-++-+-++++/|| || ||| ||||||| ||
| ||||||||||| || \+++-+--+++----+---+--++-+++-+++---+++-++/|| ||| ||| ||/-+-+--++\|||||||| | |||||||||/++++--+++-++-+-++++-++-++-+++-\||||||| ||
| ||||||||||| || |||/+--+++----+---+--++-+++-+++---+++-++-++-+++\||| ||| | | ||||||||||| | |||||||||||||| ||| || | |||| || || ||| |||||||| ||
| ||||^|||||| || ||||| ||| | | || ||| ||| ||| || || ||||||| ||| | | ||||||||||| | |||||||||||||| |\+-++-+-++++-++-++-+++-+++++/|| ||
| |\+++++++++--++--+++++--+++----+---+--++-+++-+++---+++-++-++-+/|||\+---+++-+-+--+++++++++++-+----++++++++++++++--+-+-++-+-++++-++-++-+++-++/|| || ||
| | ||||||||| || ||||| ||| | | || ||| ||| ||| || || | ||| | ||| | | ||||||||||| | /-++++++++++++++-\| | || | |||| || || ||| || || || ||
| | ||||||\++--++--+++++--+++----+---+--++-+++-+++---+++-++-++-+-+++-+---+++-+-/ ||||||||||| | | |||||||||||||| || | || | |||| || || ||| || || || ||
|/+-++++++-++-\|| ||||| ||\----+---+--++-+++-+++---+++-+/ || | ||| | ||| | ||||||||||| | | |||||||||||||| || | || | |||| || || ||| || || || ||
||| |||||| || ||| ||||| || | | || ||| ||| ||| |/-++-+-+++-+\ ||| | ||||||||||| | | |||||||||||||| || | || | |||| || || ||| || || || ||
||| |||||| || ||| ||||| || | | || ||| ||| ||| || |\-+-+++-++--+/| | ||||||||||\-+--+-++++++++++++++-++-+-++-+-+++/ || || ||| || || || ||
||| |||||| || ||| ||||| || | | || ||| ||| ||| || | | ||| || | | | |||||||||| | | ||\++++++++++/ || |/++-+-+++--++-++\||| || || || ||
||| |||||| || ||| ||||| || | | || ||| ||| ||| || | | ||| || | | | |||||||||| | | || |||||||||| || |||| | ||| || |||||| || || || ||
||| |||||| || ||| /+++++--++-----+---+--++-+++-+++---+++-++-+--+-+++-++--+-+-+----++++++++++--+--+-++\|||||||||| || |||| | ||| || |||||| || || || ||
||| |||||| || ||| ||||||/-++-----+---+--++-+++-+++---+++-++-+--+-+++-++--+-+-+----++++++++++--+--+-+++++++++++++--++-++++-+-+++-\|| |||||| || || || ||
||| |||||| || ||| ||||||| || | | || ||| ||| ||| || | | ||| || | | | |||||||||| | | ||||||||||||| || |||| | ||| ||| |||||| || || || ||
||| |||||| || ||| ||||v|| || | | || ||| ||| ||| || | | ||| || | | | |||||||||| | | ||||||||||||| || |||| | ||| ||| |||||| || || || ||
||| |||||| || |||/+++++++-++----\| | || ||| ||| ||| || | \-+++-++--+-+-+----+++++/|||| | | ||||||||||||| || |||| | ||| ||| |||||| || || || ||
||| |||||| || ||||||||||| || || | || ||| |\+---+++-++-+----+++-++--+-+-+----+++++-++++--+--+-+++++++++++++--++-++++-+-+++-+++-++++++-++-++-/| ||
||| |||||| || ||||||||||| || || | || ||| | | ||| |\-+----+++-+/ | | | ||||| |||| | | ||||||||||||| /++-++++-+-+++-+++-++++++-++-++--+\||
||| |||||| || ||||||||||| || || | || ||| | | ||| | | /+++-+---+-+-+--\ ||||| |||| | | ||||||||||||| ||| |||| | ||| ||| |||||| || || ||||
||| |||||| || ||||||||||| || || | || ||| | | ||\-+--+---++++-+---+-+-+--+-+++++-++++--+--+-+++++++++++++-+++-++++-+-+++-+/| |||||| || || ||||
\++-++++++-++-+++++++++++-++----++---+--++-+++-+-+---++--+--+---++++-+---+-+-+--+-+++++-++++--+--+-/|||||||||||| ||| |||| | ||| | | |||||| || || ||||
|| |||||| || ||||||||||| || || | || ||| | | || | | |||| | | | \--+-+++++-++++--+--+--++++++++++++-++/ |||| | ||| | | |||||| || || ||||
|| |||||| || |||||||||\+-++----++---+--++-+++-+-+---++--+--+---++++-+---+-+----+-+++++-+/|| | | |||||||||||| || |||| | ||| | | |||||| || || ||||
|| |||||| || ||||||||| | || || | || ||| | | \+--+--+---++++-+---+-+----+-+++++-+-++--+--+--+++++++++/|| || |||| | ||| | | |||||| || || ||||
|| |||||| || ||||||||| | || /-++---+--++-+++-+-+----+--+--+---++++-+---+-+----+-+++++-+-++--+--+--+++++++++-++-++-\|||| | ||| | | |||||| || || ||||
|| |||||| \+-+++++++++-+-++--+-++---+--++-+++-+-+----+--+--+---++++-+---+-+----+-+++++-+-++--+--+--+++++++++-++-++-+++/| | ||| | | |||||| || || ||||
|| |||||| | ||||\++++-+-++--+-++---+--++-+++-+-+----+--+--+---++++-+---+-+----+-+++++-+-++--+--+--+/||||||| || || ||| | | ||| | | |||||| || || ||||
|| |||||| | |||| |||| | || | || | || ||| | | | | | |||| | \-+----+-+++++-+-++--+--+--+-+++++++-++-++-+++-+-+-+++-+-+-+++++/ || || ||||
|| |||||| | |||| |||| | || | || | \+-+++-+-+----+--+--+---++++-+-----+----+-+++++-+-++--+--+--+-+++++++-/| || ||\-+-+-+++-+-+-++/|| || || ||||
|| ||||||/-+-++++-++++-+-++--+-++---+---+-+++-+-+----+\ | | |||v | | | ||||| | || | | | ||||||| | || || | | ||| | | || || || || ||||
|| |||\+++-+-++++-++++-+-++--+-++---+---+-++/ | | || | | |||| | | /-+-+++++-+-++--+--+--+-+++++++--+-++-++--+-+-+++-+-+-++-++--++-++\ ||||
|| ||| ||| | |||| |||| | || | || | | || | | || | /+---++++-+----\| | | |\+++-+-++--+--+--+-+++++++--+-++-++--+-+-+++-+-/ || || || ||| ||||
|| ||| |\+-+-++++-++++-+-++--+-++---+---/ || | | || | |\---++++-+----++--+-+-+-+++-+-++--+--+--/ ||||||| | || || | | ||| | || || || ||| ||||
|| ||| | | | |||| |||| | || /+-++---+-----++--+-+----++-+-+----++++-+----++--+-+-+-+++-+-++--+--+----+++++++--+-++-++-\| | ||| | || || || ||| ||||
|| |\+-+-+-+-++++-++++-+-++-++-++---+-----++--+-+----++-+-+----++++-+----++--+-+-+-+++-+-+/ | \----+++++++--+-+/ || || | ||| | || || || ||| ||||
|| | | | | | |||| |||| | || || || | || | | || | | |||| | || | | | ||| | | | ||\++++--+-+--++-++-+-+++-+---++-++--++-+/| ||||
|| | | | | | |||| |||| | || || ||/--+-----++--+\| || | | |||| | || | | | ||| | | | /++-++++--+-+-\|| || | ||| | || || || | | ||||
|\-+-+-+-+-+-++/| |||\-+-++-++-+++--+-----++--+++----++-+-+----++/| | || | | | ||| | | | ||| |||| | | ||| || | ||| | || || || | | ||||
| | \-+-+-+-++-+-+++--+-++-++-+++--+-----++--+++----++-+-+----++-+-+----++--+-+-+-+++-+-+---+------+/| |||| | | ||| || | |\+-+---++-++--++-+-+-++/|
| | | | | || | |||/-+-++-++\||| | || \++----++-+-+----++-+-+----++--+-+-/ ||| | | | | | |||| | | ||| || | \-+-+---++-/| || | | || |
| | | | | || | |||| | || |\++++--+-----++---++----++-+-+----++-+-+----++--+-+---+++-+-+---+------+-+-++++--+-+-+/| || | | | || | || | | || |
| | | | | || | |||| | || | |||| | || || || | | |\-+-+----++--+-+---+++-+-+---+------+-+-++++--+-+-+-+-++-+---+-+---+/ | || | | || |
| | | \-+-++-+-++++-+-++-+-++++--+-----++---++----+/ | | | | | || | | ||| | | | | | ||\+--+-+-+-+-++-/ | | | | || | | || |
| | | | || | |||| | || | |||| | || || | | \----+--+-+----/| | | ||| | | /+------+-+-++-+--+-+-+-+-++-----+\| | | || | | || |
| |/--+---+-++-+-++++-+-++-+-++++--+-\ || || | | | | | | \-+---+++-+-+--++------+-+-++-+--+-+-+-+-++-----+++---+---+--++-+-/ || |
| || | | || | |||| | || | |||| | | \+---++----+--+------+--+-+-----+----+---+++-+-+--++------+-+-++-+--+-+-+-+-++-----+++---+---+--++-/ || |
| || | | || \-++++-+-++-+-+/\+--+-+----+---++----+--+------+--+-+-----+----+---+++-+-+--++------+-+-++-+--/ | | | || ||| | | || || |
| || | | || |||| | || | | \--+-+----+---/| | | | | | \----+---/|| | | || | | || | | | | || ||| | | || || |
| || | | || |||| \-++-+-+-----+-+----+----+----+--+------+--+-+----------+----++-+-+--++------+-+-++-+----+-+-+-++-----++/ | | || || |
| || | | || |||| || | | | | | | | | | | | | || | | || | | || | | | | |\-----++----+---+--++-----++-/
\--++--+---+-/| |||\---++-+-/ | | | | | | | | | | || | | || /----+-+-++-+----+-+-+-+------++----+---+--++-\ ||
|| | | | ||| || | | v | | | | | | | | || | | || | | | || | \-+-+-+------++----+---+--++-+---+/
|| | | | ||| || | | | | | | | | | | | || | | \+-+----+-+-++-+------+-+-+-->---+/ | | || | |
|| | | | ||| \+-+-------+-+----+----+----+--+------+--+-+----------+----++-+-+---+-+----+-+-++-+------+-+-+------/ | | || | |
|| | | | ||| | | \-+----+----+----+--+------+--+-+----------+----++-+-+---+-+----+-+-++-+------+-+-+------------+---/ || | |
|| | | | ||| | | | \----+----+--+------+--+-+----------+----++-+-+---+-+----+-+-+/ | | | | | || | |
|| | \--+---+++-----+-+---------+---------+----+--+------+--+-+----------+----++-+-+---+-+----+-+-+--+------+-/ | | || | |
\+--+------+---++/ | | | | | | \--+-+----------/ || | | | | | | | | | | | || | |
| | \---++------+-+---------+---------+----+--+---------+-+---------------++-+-+---/ | | | | \------+---+------------+------/| | |
| | || | \---------+---------+----+--+---------+-+---------------++-+-+-----+----+-+-+---------+---/ | | | |
| | || | | | | \---------+-+---------------/| | | | | | | | | | | |
| | |\------+-----------+---------+----/ | | \-+-+-----+----+-+-+---------+----------------/ | | |
| | | \-----------+---------+-----------------+-+------------------+-+-----+----+-+-/ | | | |
\--+----------+-------------------/ | | | | \-----+----+-+-----------+------------------------/ | |
| | | | \------------------+-------+----+-+-----------+--------------------------+---/
| \-----------------------------+-----------------/ | | \-+-----------/ |
\----------------------------------------+--------------------------------------+-------+------/ |
\------------------------------------->/ \---------------------------------------------/
2018/day14/input.txt
-1
View File
@@ -1 +0,0 @@
293801
2018/day15/input.txt
-32
View File
@@ -1,32 +0,0 @@
################################
################.#.#..##########
################.#...G##########
################...#############
######..##########.#..##########
####.G...#########.G...#########
###.........######....##########
##..#.##.....#....#....#########
#G.#GG..................##.#####
##.##..##..G........G.........##
#######......G.G...............#
#######........................#
########.G....#####..E#...E.G..#
#########G...#######...........#
#########...#########.........##
#####.......#########....G...###
###.........#########.....E..###
#...........#########.........##
#..#....G..G#########........###
#..#.........#######.........###
#G.##G......E.#####...E..E..####
##......E...............########
#.....#G.G..............E..#####
#....#####....E........###.#####
#...#########.........####.#####
#.###########......#.#####.#####
#....##########.##...###########
#....#############....##########
##.##############E....##########
##.##############..#############
##....##########################
################################
2018/day16/input.txt
-4092
View File
File diff suppressed because it is too large Load Diff
2018/day17/input.txt
-1713
View File
File diff suppressed because it is too large Load Diff
2018/day18/input.txt
-50
View File
@@ -1,50 +0,0 @@
|.||#.##..|....|.|.|.|#||#...|.#.||#.....##|..#...
.......#.|#...|.|#........#...|..#|.|...#.|..#..##
|.#...##.|.|.|#..#..#.||#..#.##|#.|..##..|.##..|.#
|.|...||#|###..|#|#...#|.....||.....|.#.......|...
.||..|.#|.|.....||..|.#.#.|##.|..|.##|..|...#....#
.###....#.#....#..#..||.|.#..|....#||........|..#|
#..#...||#.#.|#..#..|.|.||.#|.|..#..|..|.....#....
|.#|...#|||.|.#.#|.#.|.##|||#|.#.....#..|.#.......
.....|.|....#||...|#||#|||.#..#|#..#...#|...|||...
.|......#......|.#..##......#|.##.#..#..|.#||..###
..|..|###|.|.|###.||#|.#.|..##...|..|#.|....#..#.#
||...#.#.#.......||.||..#.#|#||...|.|......#...||.
|.#.#.#|#|...#..|..#|||#|...|...|#...#..##|...|||.
|....|.....#.##|#....|##.....|..|#.|||..|##..#|..#
...||.#|#||#...|.||.#.#....||.|.|#.##.#.#|....##..
..|.#..#.##|##..........|......#..#|.|.#......#...
|..|..#....|.#|..|...##..|.#|||#...#.|..|...##|...
.|....|##...|.|.|##....||..##.|#.#..|...|..|#....#
.|#..##.||...#.|...|#........#|#|.#.|##.|##...|.|.
.|....|.|.....|...#......|...###....|.#...|...|.#.
|.||..#.#..#||..#||.|.|.####.#...#.#.#......#...#.
#|||...|#......|...#..##..##||...|#.|...#.##..||..
.||...#...#.#.........#....|#..|.#||...|.##||..|##
|....||.....#.....|..#.#.#...#.#......|...##.|#...
|.|.|#..||#.|..|.|..#.##|...#.#....#|...#|#.###|..
#...........|.#..||.|..#|.....|..|..|....##....|.|
..|.|.....#......|.|..|.....##.#.#........|....#.#
|..|..#.|..|..#.....|.|#..#..|#.|...|.#...|#|#|..|
|..#.......|###|.|..#...#.#..#|.#.####....##...|..
..#.#..#|#.|...|.#.....##.#|#..#..|..|###.....|.#.
.#....##.|..#|.#.|||.|.|......####.||...#.#..##.||
....||#..##..#|...#|.....|#.|..........|.|.|.#.#|.
|....#|..|.|#|#.....#|..|...#..|...|....|.||..||##
....#..|.#..#...|..|..#.#....|..#.#..||#....##.||#
.|....###.............||.#......#..||.#.|#..#|...|
.||..||....|#..|....#.|..|....###..#.#......|#.#..
||.|#.#.|.#.#.#.#.#|...............|#|#..||..|....
#...|#...#...|.#...|.....##...##.||#|#...#....|||.
.#..|..|.|||#......|#......|.#..........#......|#|
.....#.#..||....##.#.||##..#.|.#.|#.#...|#.#|.|...
||#.#...#.#|...|...#...##..|..|......#....|##.....
..#.#.....|#.#.#.|...|.#..#..#.|.....#...|||...|.|
|#..#..|......|.|.||.|.......#.#|....|#.|.|.|#|...
.|.....|..#...||..##.#...#..|...#.|#..||.|.#....||
.#..#...##|.|#.#...#....|.|....|......##..|.|.|...
...#.#|#.|#||#...#|..#......||#|#|.#...||.|.#.#.##
|#|.###....#...#.#....#.#....#.##...#......##..#..
....||..#.#.||......#.#|#....|.|...###|#.|||...#|.
.#.|#...||.|.....#.|.|#.#....#.....|.|...||#.|||#|
|.|.##...#..#.............||..|.||.#..|..........#
2018/day19/input.txt
-37
View File
@@ -1,37 +0,0 @@
#ip 4
addi 4 16 4
seti 1 5 1
seti 1 7 3
mulr 1 3 5
eqrr 5 2 5
addr 5 4 4
addi 4 1 4
addr 1 0 0
addi 3 1 3
gtrr 3 2 5
addr 4 5 4
seti 2 4 4
addi 1 1 1
gtrr 1 2 5
addr 5 4 4
seti 1 5 4
mulr 4 4 4
addi 2 2 2
mulr 2 2 2
mulr 4 2 2
muli 2 11 2
addi 5 2 5
mulr 5 4 5
addi 5 18 5
addr 2 5 2
addr 4 0 4
seti 0 6 4
setr 4 3 5
mulr 5 4 5
addr 4 5 5
mulr 4 5 5
muli 5 14 5
mulr 5 4 5
addr 2 5 2
seti 0 2 0
seti 0 6 4
2018/day20/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2018/day23/input.txt
-1000
View File
File diff suppressed because it is too large Load Diff
2018/day24/input.txt
-23
View File
@@ -1,23 +0,0 @@
Immune System:
956 units each with 7120 hit points (weak to bludgeoning, slashing) with an attack that does 71 radiation damage at initiative 7
1155 units each with 5643 hit points (weak to bludgeoning; immune to cold) with an attack that does 42 slashing damage at initiative 15
1658 units each with 5507 hit points (weak to cold; immune to bludgeoning, slashing) with an attack that does 32 radiation damage at initiative 3
5009 units each with 8078 hit points with an attack that does 14 slashing damage at initiative 8
22 units each with 4771 hit points (weak to radiation) with an attack that does 1906 bludgeoning damage at initiative 18
115 units each with 9090 hit points (immune to slashing; weak to bludgeoning) with an attack that does 672 slashing damage at initiative 17
1062 units each with 11023 hit points (immune to cold, radiation; weak to bludgeoning) with an attack that does 93 fire damage at initiative 19
9423 units each with 3851 hit points with an attack that does 3 radiation damage at initiative 9
530 units each with 4770 hit points (weak to fire) with an attack that does 83 fire damage at initiative 1
5021 units each with 5720 hit points (immune to fire, radiation) with an attack that does 10 fire damage at initiative 4
Infection:
6955 units each with 50073 hit points (weak to cold) with an attack that does 13 fire damage at initiative 6
925 units each with 44719 hit points (weak to cold) with an attack that does 75 slashing damage at initiative 10
442 units each with 26430 hit points with an attack that does 116 bludgeoning damage at initiative 13
959 units each with 11116 hit points (immune to fire) with an attack that does 22 cold damage at initiative 2
348 units each with 23217 hit points with an attack that does 100 radiation damage at initiative 11
1660 units each with 12513 hit points (weak to radiation) with an attack that does 14 slashing damage at initiative 12
3143 units each with 53472 hit points (immune to cold; weak to fire) with an attack that does 30 slashing damage at initiative 16
451 units each with 28782 hit points with an attack that does 127 slashing damage at initiative 14
1688 units each with 24907 hit points (weak to fire) with an attack that does 28 fire damage at initiative 5
1193 units each with 10139 hit points (weak to fire; immune to radiation, slashing) with an attack that does 15 bludgeoning damage at initiative 20
2019/day01/prompt.txt
-39
View File
@@ -1,39 +0,0 @@
--- Day 1: The Tyranny of the Rocket Equation ---
Santa has become stranded at the edge of the Solar System while delivering presents to other planets! To accurately calculate his position in space, safely align his warp drive, and return to Earth in time to save Christmas, he needs you to bring him measurements from fifty stars.
Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
The Elves quickly load you into a spacecraft and prepare to launch.
At the first Go / No Go poll, every Elf is Go until the Fuel Counter-Upper. They haven't determined the amount of fuel required yet.
Fuel required to launch a given module is based on its mass. Specifically, to find the fuel required for a module, take its mass, divide by three, round down, and subtract 2.
For example:
For a mass of 12, divide by 3 and round down to get 4, then subtract 2 to get 2.
For a mass of 14, dividing by 3 and rounding down still yields 4, so the fuel required is also 2.
For a mass of 1969, the fuel required is 654.
For a mass of 100756, the fuel required is 33583.
The Fuel Counter-Upper needs to know the total fuel requirement. To find it, individually calculate the fuel needed for the mass of each module (your puzzle input), then add together all the fuel values.
What is the sum of the fuel requirements for all of the modules on your spacecraft?
Your puzzle answer was 3198599.
--- Part Two ---
During the second Go / No Go poll, the Elf in charge of the Rocket Equation Double-Checker stops the launch sequence. Apparently, you forgot to include additional fuel for the fuel you just added.
Fuel itself requires fuel just like a module - take its mass, divide by three, round down, and subtract 2. However, that fuel also requires fuel, and that fuel requires fuel, and so on. Any mass that would require negative fuel should instead be treated as if it requires zero fuel; the remaining mass, if any, is instead handled by wishing really hard, which has no mass and is outside the scope of this calculation.
So, for each module mass, calculate its fuel and add it to the total. Then, treat the fuel amount you just calculated as the input mass and repeat the process, continuing until a fuel requirement is zero or negative. For example:
A module of mass 14 requires 2 fuel. This fuel requires no further fuel (2 divided by 3 and rounded down is 0, which would call for a negative fuel), so the total fuel required is still just 2.
At first, a module of mass 1969 requires 654 fuel. Then, this fuel requires 216 more fuel (654 / 3 - 2). 216 then requires 70 more fuel, which requires 21 fuel, which requires 5 fuel, which requires no further fuel. So, the total fuel required for a module of mass 1969 is 654 + 216 + 70 + 21 + 5 = 966.
The fuel required by a module of mass 100756 and its fuel is: 33583 + 11192 + 3728 + 1240 + 411 + 135 + 43 + 12 + 2 = 50346.
What is the sum of the fuel requirements for all of the modules on your spacecraft when also taking into account the mass of the added fuel? (Calculate the fuel requirements for each module separately, then add them all up at the end.)
Your puzzle answer was 4795042.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day02/input.txt
-1
View File
@@ -1 +0,0 @@
1, 12, 2, 3, 1, 1, 2, 3, 1, 3, 4, 3, 1, 5, 0, 3, 2, 1, 6, 19, 1, 19, 5, 23, 2, 13, 23, 27, 1, 10, 27, 31, 2, 6, 31, 35, 1, 9, 35, 39, 2, 10, 39, 43, 1, 43, 9, 47, 1, 47, 9, 51, 2, 10, 51, 55, 1, 55, 9, 59, 1, 59, 5, 63, 1, 63, 6, 67, 2, 6, 67, 71, 2, 10, 71, 75, 1, 75, 5, 79, 1, 9, 79, 83, 2, 83, 10, 87, 1, 87, 6, 91, 1, 13, 91, 95, 2, 10, 95, 99, 1, 99, 6, 103, 2, 13, 103, 107, 1, 107, 2, 111, 1, 111, 9, 0, 99, 2, 14, 0, 0
2019/day02/prompt.txt
-72
View File
@@ -1,72 +0,0 @@
--- Day 2: 1202 Program Alarm ---
On the way to your gravity assist around the Moon, your ship computer beeps angrily about a "1202 program alarm". On the radio, an Elf is already explaining how to handle the situation: "Don't worry, that's perfectly norma--" The ship computer bursts into flames.
You notify the Elves that the computer's magic smoke seems to have escaped. "That computer ran Intcode programs like the gravity assist program it was working on; surely there are enough spare parts up there to build a new Intcode computer!"
An Intcode program is a list of integers separated by commas (like 1,0,0,3,99). To run one, start by looking at the first integer (called position 0). Here, you will find an opcode - either 1, 2, or 99. The opcode indicates what to do; for example, 99 means that the program is finished and should immediately halt. Encountering an unknown opcode means something went wrong.
Opcode 1 adds together numbers read from two positions and stores the result in a third position. The three integers immediately after the opcode tell you these three positions - the first two indicate the positions from which you should read the input values, and the third indicates the position at which the output should be stored.
For example, if your Intcode computer encounters 1,10,20,30, it should read the values at positions 10 and 20, add those values, and then overwrite the value at position 30 with their sum.
Opcode 2 works exactly like opcode 1, except it multiplies the two inputs instead of adding them. Again, the three integers after the opcode indicate where the inputs and outputs are, not their values.
Once you're done processing an opcode, move to the next one by stepping forward 4 positions.
For example, suppose you have the following program:
1,9,10,3,2,3,11,0,99,30,40,50
For the purposes of illustration, here is the same program split into multiple lines:
1,9,10,3,
2,3,11,0,
99,
30,40,50
The first four integers, 1,9,10,3, are at positions 0, 1, 2, and 3. Together, they represent the first opcode (1, addition), the positions of the two inputs (9 and 10), and the position of the output (3). To handle this opcode, you first need to get the values at the input positions: position 9 contains 30, and position 10 contains 40. Add these numbers together to get 70. Then, store this value at the output position; here, the output position (3) is at position 3, so it overwrites itself. Afterward, the program looks like this:
1,9,10,70,
2,3,11,0,
99,
30,40,50
Step forward 4 positions to reach the next opcode, 2. This opcode works just like the previous, but it multiplies instead of adding. The inputs are at positions 3 and 11; these positions contain 70 and 50 respectively. Multiplying these produces 3500; this is stored at position 0:
3500,9,10,70,
2,3,11,0,
99,
30,40,50
Stepping forward 4 more positions arrives at opcode 99, halting the program.
Here are the initial and final states of a few more small programs:
1,0,0,0,99 becomes 2,0,0,0,99 (1 + 1 = 2).
2,3,0,3,99 becomes 2,3,0,6,99 (3 * 2 = 6).
2,4,4,5,99,0 becomes 2,4,4,5,99,9801 (99 * 99 = 9801).
1,1,1,4,99,5,6,0,99 becomes 30,1,1,4,2,5,6,0,99.
Once you have a working computer, the first step is to restore the gravity assist program (your puzzle input) to the "1202 program alarm" state it had just before the last computer caught fire. To do this, before running the program, replace position 1 with the value 12 and replace position 2 with the value 2. What value is left at position 0 after the program halts?
Your puzzle answer was 2692315.
--- Part Two ---
"Good, the new computer seems to be working correctly! Keep it nearby during this mission - you'll probably use it again. Real Intcode computers support many more features than your new one, but we'll let you know what they are as you need them."
"However, your current priority should be to complete your gravity assist around the Moon. For this mission to succeed, we should settle on some terminology for the parts you've already built."
Intcode programs are given as a list of integers; these values are used as the initial state for the computer's memory. When you run an Intcode program, make sure to start by initializing memory to the program's values. A position in memory is called an address (for example, the first value in memory is at "address 0").
Opcodes (like 1, 2, or 99) mark the beginning of an instruction. The values used immediately after an opcode, if any, are called the instruction's parameters. For example, in the instruction 1,2,3,4, 1 is the opcode; 2, 3, and 4 are the parameters. The instruction 99 contains only an opcode and has no parameters.
The address of the current instruction is called the instruction pointer; it starts at 0. After an instruction finishes, the instruction pointer increases by the number of values in the instruction; until you add more instructions to the computer, this is always 4 (1 opcode + 3 parameters) for the add and multiply instructions. (The halt instruction would increase the instruction pointer by 1, but it halts the program instead.)
"With terminology out of the way, we're ready to proceed. To complete the gravity assist, you need to determine what pair of inputs produces the output 19690720."
The inputs should still be provided to the program by replacing the values at addresses 1 and 2, just like before. In this program, the value placed in address 1 is called the noun, and the value placed in address 2 is called the verb. Each of the two input values will be between 0 and 99, inclusive.
Once the program has halted, its output is available at address 0, also just like before. Each time you try a pair of inputs, make sure you first reset the computer's memory to the values in the program (your puzzle input) - in other words, don't reuse memory from a previous attempt.
Find the input noun and verb that cause the program to produce the output 19690720. What is 100 * noun + verb? (For example, if noun=12 and verb=2, the answer would be 1202.)
Your puzzle answer was 9507.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day03/input.txt
-2
View File
@@ -1,2 +0,0 @@
R1008,U428,L339,U16,R910,U221,R53,D546,L805,U376,L19,U708,R493,D489,L443,D567,R390,D771,R270,U737,R926,U181,L306,D456,L668,D79,L922,U433,L701,U472,R914,U903,L120,U199,L273,D206,L967,U711,R976,U976,R603,U8,L882,U980,R561,D697,L224,D620,L483,U193,R317,D588,L932,D990,R658,U998,L136,U759,R463,U890,L297,U648,R163,U250,R852,U699,R236,D254,L173,U720,L259,U632,L635,U426,R235,D699,R411,U650,L258,D997,L781,D209,L697,D306,L793,U657,L936,U317,R549,D798,L951,D80,R591,D480,R835,U292,L722,U987,L775,U173,R353,U404,L250,U652,L527,D282,L365,D657,L141,D301,R128,D590,L666,U478,L85,D822,L716,U68,R253,D186,R81,U741,L316,D615,L570,U407,L734,D345,L652,U362,L360,D791,R358,U190,L823,U274,L279,D998,L16,D644,L201,D469,R213,D487,L251,D395,R130,U902,L398,U201,L56,D850,R541,D661,R921,U647,R309,D550,L307,D68,R894,U653,L510,D375,R20,U86,R357,D120,L978,D200,L45,D247,R906,U334,L242,D466,R418,U548,R698,D158,R582,U469,L968,U736,R196,U437,R87,D722,R811,U625,L425,D675,L904,D331,R693,D491,R559,U540,L120,D975,R180,U224,R610,U260,L769,D486,R93,D300,L230,U181,L60,U910,L60,D554,L527,U37,R69,D649,R768,D835,L581,U932,L746,U170,L733,U40,L497,D957,R12,U686,R85,D461,R796,D142,R664,U787,R636,D621,R824,D421,R902,D686,L202,D839,R567,D129,L77,D917,L200,D106,R3,D546,L101,D762,R780,U334,L410,D190,R431,D828,L816,D529,R648,D449,L845,U49,R750,U864,L133,D822,R46,U475,L229,U929,L676,D793,R379,U71,L243,U640,L122,U183,R528,U22,R375,D928,R292,U796,R259,U325,L921,U489,L246,D153,L384,D684,L243,U65,L342,U662,R707
L1008,D243,L602,D497,L395,U81,R589,U94,R640,D965,L397,D781,R464,U642,L130,D740,R938,D260,L106,D323,L626,U869,L495,U450,R640,D675,R602,D449,L542,U917,L244,U702,L644,D809,R902,U163,R118,U982,L867,D795,R546,U194,R397,D877,L354,D255,L477,U45,L707,D624,R806,U642,L926,D233,L800,U691,L990,D979,L431,U999,L423,D794,L238,U25,R986,U595,L167,U480,L555,U831,R496,U799,L897,D895,L993,D11,R486,U176,L90,U842,R499,U792,R787,U859,L100,U169,R170,D89,R297,D944,R362,D460,R147,U831,L45,U972,R582,D90,L934,U284,R555,U235,L138,U837,R965,U915,R928,U982,R157,D566,L953,U653,L629,U460,L335,D912,R355,D683,L710,D562,R392,D44,R707,D979,L749,D223,L776,D723,R735,D356,R49,U567,L563,D220,L868,U223,R448,D505,L411,U662,L188,D536,R55,U718,L108,D289,R435,U98,R775,U933,L127,D84,R253,D523,L2,D905,R266,U675,R758,D331,R122,U988,R215,D500,R89,U306,R833,U763,R570,D818,L985,U127,L87,D210,R355,D532,R870,U196,R695,U633,R170,D540,R506,U708,L663,U566,L633,U306,L452,U180,R463,D21,L220,D268,R608,U986,L493,D598,L957,D116,L454,D584,L405,U651,R352,U681,R807,U767,L988,U692,R474,U710,R607,U313,R711,U12,R371,D561,R72,U522,R270,U904,L49,U525,R562,U895,L232,D319,R902,D236,L601,D816,R836,U419,R610,U644,L733,U355,L836,U228,L895,D39,L44,D848,L965,U475,R56,U62,L458,U99,R236,D763,R912,U295,R515,U179,R20,D777,R511,D906,R903,U855,L507,D512,L63,D630,R442,U595,L701,U654,R238,D35,L31,D469,R6,D222,R132,D837,R921,U838,R986,D441,L950,D530,L397,U41,L81,D60,L245,D75,R620,D455,L937,D180,R215,D684,R724,U561,R479,D353,L501
2019/day03/prompt.txt
-75
View File
@@ -1,75 +0,0 @@
--- Day 3: Crossed Wires ---
The gravity assist was successful, and you're well on your way to the Venus refuelling station. During the rush back on Earth, the fuel management system wasn't completely installed, so that's next on the priority list.
Opening the front panel reveals a jumble of wires. Specifically, two wires are connected to a central port and extend outward on a grid. You trace the path each wire takes as it leaves the central port, one wire per line of text (your puzzle input).
The wires twist and turn, but the two wires occasionally cross paths. To fix the circuit, you need to find the intersection point closest to the central port. Because the wires are on a grid, use the Manhattan distance for this measurement. While the wires do technically cross right at the central port where they both start, this point does not count, nor does a wire count as crossing with itself.
For example, if the first wire's path is R8,U5,L5,D3, then starting from the central port (o), it goes right 8, up 5, left 5, and finally down 3:
...........
...........
...........
....+----+.
....|....|.
....|....|.
....|....|.
.........|.
.o-------+.
...........
Then, if the second wire's path is U7,R6,D4,L4, it goes up 7, right 6, down 4, and left 4:
...........
.+-----+...
.|.....|...
.|..+--X-+.
.|..|..|.|.
.|.-X--+.|.
.|..|....|.
.|.......|.
.o-------+.
...........
These wires cross at two locations (marked X), but the lower-left one is closer to the central port: its distance is 3 + 3 = 6.
Here are a few more examples:
R75,D30,R83,U83,L12,D49,R71,U7,L72
U62,R66,U55,R34,D71,R55,D58,R83 = distance 159
R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = distance 135
What is the Manhattan distance from the central port to the closest intersection?
Your puzzle answer was 2180.
--- Part Two ---
It turns out that this circuit is very timing-sensitive; you actually need to minimize the signal delay.
To do this, calculate the number of steps each wire takes to reach each intersection; choose the intersection where the sum of both wires' steps is lowest. If a wire visits a position on the grid multiple times, use the steps value from the first time it visits that position when calculating the total value of a specific intersection.
The number of steps a wire takes is the total number of grid squares the wire has entered to get to that location, including the intersection being considered. Again consider the example from above:
...........
.+-----+...
.|.....|...
.|..+--X-+.
.|..|..|.|.
.|.-X--+.|.
.|..|....|.
.|.......|.
.o-------+.
...........
In the above example, the intersection closest to the central port is reached after 8+5+5+2 = 20 steps by the first wire and 7+6+4+3 = 20 steps by the second wire for a total of 20+20 = 40 steps.
However, the top-right intersection is better: the first wire takes only 8+5+2 = 15 and the second wire takes only 7+6+2 = 15, a total of 15+15 = 30 steps.
Here are the best steps for the extra examples from above:
R75,D30,R83,U83,L12,D49,R71,U7,L72
U62,R66,U55,R34,D71,R55,D58,R83 = 610 steps
R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = 410 steps
What is the fewest combined steps the wires must take to reach an intersection?
Your puzzle answer was 112316.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day04/input.txt
-1
View File
@@ -1 +0,0 @@
138307-654504
2019/day04/prompt.txt
-35
View File
@@ -1,35 +0,0 @@
--- Day 4: Secure Container ---
You arrive at the Venus fuel depot only to discover it's protected by a password. The Elves had written the password on a sticky note, but someone threw it out.
However, they do remember a few key facts about the password:
It is a six-digit number.
The value is within the range given in your puzzle input.
Two adjacent digits are the same (like 22 in 122345).
Going from left to right, the digits never decrease; they only ever increase or stay the same (like 111123 or 135679).
Other than the range rule, the following are true:
111111 meets these criteria (double 11, never decreases).
223450 does not meet these criteria (decreasing pair of digits 50).
123789 does not meet these criteria (no double).
How many different passwords within the range given in your puzzle input meet these criteria?
Your puzzle answer was 1855.
--- Part Two ---
An Elf just remembered one more important detail: the two adjacent matching digits are not part of a larger group of matching digits.
Given this additional criterion, but still ignoring the range rule, the following are now true:
112233 meets these criteria because the digits never decrease and all repeated digits are exactly two digits long.
123444 no longer meets the criteria (the repeated 44 is part of a larger group of 444).
111122 meets the criteria (even though 1 is repeated more than twice, it still contains a double 22).
How many different passwords within the range given in your puzzle input meet all of the criteria?
Your puzzle answer was 1253.
Both parts of this puzzle are complete! They provide two gold stars: **
At this point, you should return to your Advent calendar and try another puzzle.
Your puzzle input was 138307-654504.
2019/day05/input.txt
-1
View File
@@ -1 +0,0 @@
3,225,1,225,6,6,1100,1,238,225,104,0,1,192,154,224,101,-161,224,224,4,224,102,8,223,223,101,5,224,224,1,223,224,223,1001,157,48,224,1001,224,-61,224,4,224,102,8,223,223,101,2,224,224,1,223,224,223,1102,15,28,225,1002,162,75,224,1001,224,-600,224,4,224,1002,223,8,223,1001,224,1,224,1,224,223,223,102,32,57,224,1001,224,-480,224,4,224,102,8,223,223,101,1,224,224,1,224,223,223,1101,6,23,225,1102,15,70,224,1001,224,-1050,224,4,224,1002,223,8,223,101,5,224,224,1,224,223,223,101,53,196,224,1001,224,-63,224,4,224,102,8,223,223,1001,224,3,224,1,224,223,223,1101,64,94,225,1102,13,23,225,1101,41,8,225,2,105,187,224,1001,224,-60,224,4,224,1002,223,8,223,101,6,224,224,1,224,223,223,1101,10,23,225,1101,16,67,225,1101,58,10,225,1101,25,34,224,1001,224,-59,224,4,224,1002,223,8,223,1001,224,3,224,1,223,224,223,4,223,99,0,0,0,677,0,0,0,0,0,0,0,0,0,0,0,1105,0,99999,1105,227,247,1105,1,99999,1005,227,99999,1005,0,256,1105,1,99999,1106,227,99999,1106,0,265,1105,1,99999,1006,0,99999,1006,227,274,1105,1,99999,1105,1,280,1105,1,99999,1,225,225,225,1101,294,0,0,105,1,0,1105,1,99999,1106,0,300,1105,1,99999,1,225,225,225,1101,314,0,0,106,0,0,1105,1,99999,1108,226,226,224,102,2,223,223,1005,224,329,101,1,223,223,107,226,226,224,1002,223,2,223,1005,224,344,1001,223,1,223,107,677,226,224,102,2,223,223,1005,224,359,101,1,223,223,7,677,226,224,102,2,223,223,1005,224,374,101,1,223,223,108,226,226,224,102,2,223,223,1006,224,389,101,1,223,223,1007,677,677,224,102,2,223,223,1005,224,404,101,1,223,223,7,226,677,224,102,2,223,223,1006,224,419,101,1,223,223,1107,226,677,224,1002,223,2,223,1005,224,434,1001,223,1,223,1108,226,677,224,102,2,223,223,1005,224,449,101,1,223,223,108,226,677,224,102,2,223,223,1005,224,464,1001,223,1,223,8,226,677,224,1002,223,2,223,1005,224,479,1001,223,1,223,1007,226,226,224,102,2,223,223,1006,224,494,101,1,223,223,1008,226,677,224,102,2,223,223,1006,224,509,101,1,223,223,1107,677,226,224,1002,223,2,223,1006,224,524,1001,223,1,223,108,677,677,224,1002,223,2,223,1005,224,539,1001,223,1,223,1107,226,226,224,1002,223,2,223,1006,224,554,1001,223,1,223,7,226,226,224,1002,223,2,223,1006,224,569,1001,223,1,223,8,677,226,224,102,2,223,223,1006,224,584,101,1,223,223,1008,677,677,224,102,2,223,223,1005,224,599,101,1,223,223,1007,226,677,224,1002,223,2,223,1006,224,614,1001,223,1,223,8,677,677,224,1002,223,2,223,1005,224,629,101,1,223,223,107,677,677,224,102,2,223,223,1005,224,644,101,1,223,223,1108,677,226,224,102,2,223,223,1005,224,659,101,1,223,223,1008,226,226,224,102,2,223,223,1006,224,674,1001,223,1,223,4,223,99,226
2019/day05/prompt.txt
-86
View File
@@ -1,86 +0,0 @@
--- Day 5: Sunny with a Chance of Asteroids ---
You're starting to sweat as the ship makes its way toward Mercury. The Elves suggest that you get the air conditioner working by upgrading your ship computer to support the Thermal Environment Supervision Terminal.
The Thermal Environment Supervision Terminal (TEST) starts by running a diagnostic program (your puzzle input). The TEST diagnostic program will run on your existing Intcode computer after a few modifications:
First, you'll need to add two new instructions:
Opcode 3 takes a single integer as input and saves it to the position given by its only parameter. For example, the instruction 3,50 would take an input value and store it at address 50.
Opcode 4 outputs the value of its only parameter. For example, the instruction 4,50 would output the value at address 50.
Programs that use these instructions will come with documentation that explains what should be connected to the input and output. The program 3,0,4,0,99 outputs whatever it gets as input, then halts.
Second, you'll need to add support for parameter modes:
Each parameter of an instruction is handled based on its parameter mode. Right now, your ship computer already understands parameter mode 0, position mode, which causes the parameter to be interpreted as a position - if the parameter is 50, its value is the value stored at address 50 in memory. Until now, all parameters have been in position mode.
Now, your ship computer will also need to handle parameters in mode 1, immediate mode. In immediate mode, a parameter is interpreted as a value - if the parameter is 50, its value is simply 50.
Parameter modes are stored in the same value as the instruction's opcode. The opcode is a two-digit number based only on the ones and tens digit of the value, that is, the opcode is the rightmost two digits of the first value in an instruction. Parameter modes are single digits, one per parameter, read right-to-left from the opcode: the first parameter's mode is in the hundreds digit, the second parameter's mode is in the thousands digit, the third parameter's mode is in the ten-thousands digit, and so on. Any missing modes are 0.
For example, consider the program 1002,4,3,4,33.
The first instruction, 1002,4,3,4, is a multiply instruction - the rightmost two digits of the first value, 02, indicate opcode 2, multiplication. Then, going right to left, the parameter modes are 0 (hundreds digit), 1 (thousands digit), and 0 (ten-thousands digit, not present and therefore zero):
ABCDE
1002
DE - two-digit opcode, 02 == opcode 2
C - mode of 1st parameter, 0 == position mode
B - mode of 2nd parameter, 1 == immediate mode
A - mode of 3rd parameter, 0 == position mode,
omitted due to being a leading zero
This instruction multiplies its first two parameters. The first parameter, 4 in position mode, works like it did before - its value is the value stored at address 4 (33). The second parameter, 3 in immediate mode, simply has value 3. The result of this operation, 33 * 3 = 99, is written according to the third parameter, 4 in position mode, which also works like it did before - 99 is written to address 4.
Parameters that an instruction writes to will never be in immediate mode.
Finally, some notes:
It is important to remember that the instruction pointer should increase by the number of values in the instruction after the instruction finishes. Because of the new instructions, this amount is no longer always 4.
Integers can be negative: 1101,100,-1,4,0 is a valid program (find 100 + -1, store the result in position 4).
The TEST diagnostic program will start by requesting from the user the ID of the system to test by running an input instruction - provide it 1, the ID for the ship's air conditioner unit.
It will then perform a series of diagnostic tests confirming that various parts of the Intcode computer, like parameter modes, function correctly. For each test, it will run an output instruction indicating how far the result of the test was from the expected value, where 0 means the test was successful. Non-zero outputs mean that a function is not working correctly; check the instructions that were run before the output instruction to see which one failed.
Finally, the program will output a diagnostic code and immediately halt. This final output isn't an error; an output followed immediately by a halt means the program finished. If all outputs were zero except the diagnostic code, the diagnostic program ran successfully.
After providing 1 to the only input instruction and passing all the tests, what diagnostic code does the program produce?
Your puzzle answer was 11049715.
--- Part Two ---
The air conditioner comes online! Its cold air feels good for a while, but then the TEST alarms start to go off. Since the air conditioner can't vent its heat anywhere but back into the spacecraft, it's actually making the air inside the ship warmer.
Instead, you'll need to use the TEST to extend the thermal radiators. Fortunately, the diagnostic program (your puzzle input) is already equipped for this. Unfortunately, your Intcode computer is not.
Your computer is only missing a few opcodes:
Opcode 5 is jump-if-true: if the first parameter is non-zero, it sets the instruction pointer to the value from the second parameter. Otherwise, it does nothing.
Opcode 6 is jump-if-false: if the first parameter is zero, it sets the instruction pointer to the value from the second parameter. Otherwise, it does nothing.
Opcode 7 is less than: if the first parameter is less than the second parameter, it stores 1 in the position given by the third parameter. Otherwise, it stores 0.
Opcode 8 is equals: if the first parameter is equal to the second parameter, it stores 1 in the position given by the third parameter. Otherwise, it stores 0.
Like all instructions, these instructions need to support parameter modes as described above.
Normally, after an instruction is finished, the instruction pointer increases by the number of values in that instruction. However, if the instruction modifies the instruction pointer, that value is used and the instruction pointer is not automatically increased.
For example, here are several programs that take one input, compare it to the value 8, and then produce one output:
3,9,8,9,10,9,4,9,99,-1,8 - Using position mode, consider whether the input is equal to 8; output 1 (if it is) or 0 (if it is not).
3,9,7,9,10,9,4,9,99,-1,8 - Using position mode, consider whether the input is less than 8; output 1 (if it is) or 0 (if it is not).
3,3,1108,-1,8,3,4,3,99 - Using immediate mode, consider whether the input is equal to 8; output 1 (if it is) or 0 (if it is not).
3,3,1107,-1,8,3,4,3,99 - Using immediate mode, consider whether the input is less than 8; output 1 (if it is) or 0 (if it is not).
Here are some jump tests that take an input, then output 0 if the input was zero or 1 if the input was non-zero:
3,12,6,12,15,1,13,14,13,4,13,99,-1,0,1,9 (using position mode)
3,3,1105,-1,9,1101,0,0,12,4,12,99,1 (using immediate mode)
Here's a larger example:
3,21,1008,21,8,20,1005,20,22,107,8,21,20,1006,20,31,
1106,0,36,98,0,0,1002,21,125,20,4,20,1105,1,46,104,
999,1105,1,46,1101,1000,1,20,4,20,1105,1,46,98,99
The above example program uses an input instruction to ask for a single number. The program will then output 999 if the input value is below 8, output 1000 if the input value is equal to 8, or output 1001 if the input value is greater than 8.
This time, when the TEST diagnostic program runs its input instruction to get the ID of the system to test, provide it 5, the ID for the ship's thermal radiator controller. This diagnostic test suite only outputs one number, the diagnostic code.
What is the diagnostic code for system ID 5?
Your puzzle answer was 2140710.
2019/day06/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day06/prompt.txt
-104
View File
@@ -1,104 +0,0 @@
--- Day 6: Universal Orbit Map ---
You've landed at the Universal Orbit Map facility on Mercury. Because navigation in space often involves transferring between orbits, the orbit maps here are useful for finding efficient routes between, for example, you and Santa. You download a map of the local orbits (your puzzle input).
Except for the universal Center of Mass (COM), every object in space is in orbit around exactly one other object. An orbit looks roughly like this:
\
\
|
|
AAA--> o o <--BBB
|
|
/
/
In this diagram, the object BBB is in orbit around AAA. The path that BBB takes around AAA (drawn with lines) is only partly shown. In the map data, this orbital relationship is written AAA)BBB, which means "BBB is in orbit around AAA".
Before you use your map data to plot a course, you need to make sure it wasn't corrupted during the download. To verify maps, the Universal Orbit Map facility uses orbit count checksums - the total number of direct orbits (like the one shown above) and indirect orbits.
Whenever A orbits B and B orbits C, then A indirectly orbits C. This chain can be any number of objects long: if A orbits B, B orbits C, and C orbits D, then A indirectly orbits D.
For example, suppose you have the following map:
COM)B
B)C
C)D
D)E
E)F
B)G
G)H
D)I
E)J
J)K
K)L
Visually, the above map of orbits looks like this:
G - H J - K - L
/ /
COM - B - C - D - E - F
\
I
In this visual representation, when two objects are connected by a line, the one on the right directly orbits the one on the left.
Here, we can count the total number of orbits as follows:
D directly orbits C and indirectly orbits B and COM, a total of 3 orbits.
L directly orbits K and indirectly orbits J, E, D, C, B, and COM, a total of 7 orbits.
COM orbits nothing.
The total number of direct and indirect orbits in this example is 42.
What is the total number of direct and indirect orbits in your map data?
Your puzzle answer was 301100.
--- Part Two ---
Now, you just need to figure out how many orbital transfers you (YOU) need to take to get to Santa (SAN).
You start at the object YOU are orbiting; your destination is the object SAN is orbiting. An orbital transfer lets you move from any object to an object orbiting or orbited by that object.
For example, suppose you have the following map:
COM)B
B)C
C)D
D)E
E)F
B)G
G)H
D)I
E)J
J)K
K)L
K)YOU
I)SAN
Visually, the above map of orbits looks like this:
YOU
/
G - H J - K - L
/ /
COM - B - C - D - E - F
\
I - SAN
In this example, YOU are in orbit around K, and SAN is in orbit around I. To move from K to I, a minimum of 4 orbital transfers are required:
K to J
J to E
E to D
D to I
Afterward, the map of orbits looks like this:
G - H J - K - L
/ /
COM - B - C - D - E - F
\
I - SAN
\
YOU
What is the minimum number of orbital transfers required to move from the object YOU are orbiting to the object SAN is orbiting? (Between the objects they are orbiting - not between YOU and SAN.)
Your puzzle answer was 547.
Both parts of this puzzle are complete! They provide two gold stars: **
A
2019/day07/input.txt
-1
View File
@@ -1 +0,0 @@
3,8,1001,8,10,8,105,1,0,0,21,42,55,64,77,94,175,256,337,418,99999,3,9,102,4,9,9,1001,9,5,9,102,2,9,9,101,3,9,9,4,9,99,3,9,102,2,9,9,101,5,9,9,4,9,99,3,9,1002,9,4,9,4,9,99,3,9,102,4,9,9,101,5,9,9,4,9,99,3,9,102,5,9,9,1001,9,3,9,1002,9,5,9,4,9,99,3,9,1002,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,101,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,99,3,9,1002,9,2,9,4,9,3,9,1001,9,2,9,4,9,3,9,1001,9,1,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,101,2,9,9,4,9,3,9,1001,9,1,9,4,9,3,9,1001,9,1,9,4,9,99,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,101,2,9,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,99,3,9,101,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,1001,9,2,9,4,9,3,9,101,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,99,3,9,1001,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,102,2,9,9,4,9,3,9,102,2,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,101,1,9,9,4,9,3,9,101,1,9,9,4,9,3,9,1002,9,2,9,4,9,3,9,1002,9,2,9,4,9,3,9,1001,9,1,9,4,9,99
2019/day07/prompt.txt
-79
View File
@@ -1,79 +0,0 @@
--- Day 7: Amplification Circuit ---
Based on the navigational maps, you're going to need to send more power to your ship's thrusters to reach Santa in time. To do this, you'll need to configure a series of amplifiers already installed on the ship.
There are five amplifiers connected in series; each one receives an input signal and produces an output signal. They are connected such that the first amplifier's output leads to the second amplifier's input, the second amplifier's output leads to the third amplifier's input, and so on. The first amplifier's input value is 0, and the last amplifier's output leads to your ship's thrusters.
O-------O O-------O O-------O O-------O O-------O
0 ->| Amp A |->| Amp B |->| Amp C |->| Amp D |->| Amp E |-> (to thrusters)
O-------O O-------O O-------O O-------O O-------O
The Elves have sent you some Amplifier Controller Software (your puzzle input), a program that should run on your existing Intcode computer. Each amplifier will need to run a copy of the program.
When a copy of the program starts running on an amplifier, it will first use an input instruction to ask the amplifier for its current phase setting (an integer from 0 to 4). Each phase setting is used exactly once, but the Elves can't remember which amplifier needs which phase setting.
The program will then call another input instruction to get the amplifier's input signal, compute the correct output signal, and supply it back to the amplifier with an output instruction. (If the amplifier has not yet received an input signal, it waits until one arrives.)
Your job is to find the largest output signal that can be sent to the thrusters by trying every possible combination of phase settings on the amplifiers. Make sure that memory is not shared or reused between copies of the program.
For example, suppose you want to try the phase setting sequence 3,1,2,4,0, which would mean setting amplifier A to phase setting 3, amplifier B to setting 1, C to 2, D to 4, and E to 0. Then, you could determine the output signal that gets sent from amplifier E to the thrusters with the following steps:
Start the copy of the amplifier controller software that will run on amplifier A. At its first input instruction, provide it the amplifier's phase setting, 3. At its second input instruction, provide it the input signal, 0. After some calculations, it will use an output instruction to indicate the amplifier's output signal.
Start the software for amplifier B. Provide it the phase setting (1) and then whatever output signal was produced from amplifier A. It will then produce a new output signal destined for amplifier C.
Start the software for amplifier C, provide the phase setting (2) and the value from amplifier B, then collect its output signal.
Run amplifier D's software, provide the phase setting (4) and input value, and collect its output signal.
Run amplifier E's software, provide the phase setting (0) and input value, and collect its output signal.
The final output signal from amplifier E would be sent to the thrusters. However, this phase setting sequence may not have been the best one; another sequence might have sent a higher signal to the thrusters.
Here are some example programs:
Max thruster signal 43210 (from phase setting sequence 4,3,2,1,0):
3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0
Max thruster signal 54321 (from phase setting sequence 0,1,2,3,4):
3,23,3,24,1002,24,10,24,1002,23,-1,23,
101,5,23,23,1,24,23,23,4,23,99,0,0
Max thruster signal 65210 (from phase setting sequence 1,0,4,3,2):
3,31,3,32,1002,32,10,32,1001,31,-2,31,1007,31,0,33,
1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0
Try every combination of phase settings on the amplifiers. What is the highest signal that can be sent to the thrusters?
Your puzzle answer was 21760.
--- Part Two ---
It's no good - in this configuration, the amplifiers can't generate a large enough output signal to produce the thrust you'll need. The Elves quickly talk you through rewiring the amplifiers into a feedback loop:
O-------O O-------O O-------O O-------O O-------O
0 -+->| Amp A |->| Amp B |->| Amp C |->| Amp D |->| Amp E |-.
| O-------O O-------O O-------O O-------O O-------O |
| |
'--------------------------------------------------------+
|
v
(to thrusters)
Most of the amplifiers are connected as they were before; amplifier A's output is connected to amplifier B's input, and so on. However, the output from amplifier E is now connected into amplifier A's input. This creates the feedback loop: the signal will be sent through the amplifiers many times.
In feedback loop mode, the amplifiers need totally different phase settings: integers from 5 to 9, again each used exactly once. These settings will cause the Amplifier Controller Software to repeatedly take input and produce output many times before halting. Provide each amplifier its phase setting at its first input instruction; all further input/output instructions are for signals.
Don't restart the Amplifier Controller Software on any amplifier during this process. Each one should continue receiving and sending signals until it halts.
All signals sent or received in this process will be between pairs of amplifiers except the very first signal and the very last signal. To start the process, a 0 signal is sent to amplifier A's input exactly once.
Eventually, the software on the amplifiers will halt after they have processed the final loop. When this happens, the last output signal from amplifier E is sent to the thrusters. Your job is to find the largest output signal that can be sent to the thrusters using the new phase settings and feedback loop arrangement.
Here are some example programs:
Max thruster signal 139629729 (from phase setting sequence 9,8,7,6,5):
3,26,1001,26,-4,26,3,27,1002,27,2,27,1,27,26,
27,4,27,1001,28,-1,28,1005,28,6,99,0,0,5
Max thruster signal 18216 (from phase setting sequence 9,7,8,5,6):
3,52,1001,52,-5,52,3,53,1,52,56,54,1007,54,5,55,1005,55,26,1001,54,
-5,54,1105,1,12,1,53,54,53,1008,54,0,55,1001,55,1,55,2,53,55,53,4,
53,1001,56,-1,56,1005,56,6,99,0,0,0,0,10
Try every combination of the new phase settings on the amplifier feedback loop. What is the highest signal that can be sent to the thrusters?
Your puzzle answer was 69816958.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day08/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day08/prompt.txt
-57
View File
@@ -1,57 +0,0 @@
--- Day 8: Space Image Format ---
The Elves' spirits are lifted when they realize you have an opportunity to reboot one of their Mars rovers, and so they are curious if you would spend a brief sojourn on Mars. You land your ship near the rover.
When you reach the rover, you discover that it's already in the process of rebooting! It's just waiting for someone to enter a BIOS password. The Elf responsible for the rover takes a picture of the password (your puzzle input) and sends it to you via the Digital Sending Network.
Unfortunately, images sent via the Digital Sending Network aren't encoded with any normal encoding; instead, they're encoded in a special Space Image Format. None of the Elves seem to remember why this is the case. They send you the instructions to decode it.
Images are sent as a series of digits that each represent the color of a single pixel. The digits fill each row of the image left-to-right, then move downward to the next row, filling rows top-to-bottom until every pixel of the image is filled.
Each image actually consists of a series of identically-sized layers that are filled in this way. So, the first digit corresponds to the top-left pixel of the first layer, the second digit corresponds to the pixel to the right of that on the same layer, and so on until the last digit, which corresponds to the bottom-right pixel of the last layer.
For example, given an image 3 pixels wide and 2 pixels tall, the image data 123456789012 corresponds to the following image layers:
Layer 1: 123
456
Layer 2: 789
012
The image you received is 25 pixels wide and 6 pixels tall.
To make sure the image wasn't corrupted during transmission, the Elves would like you to find the layer that contains the fewest 0 digits. On that layer, what is the number of 1 digits multiplied by the number of 2 digits?
Your puzzle answer was 1806.
--- Part Two ---
Now you're ready to decode the image. The image is rendered by stacking the layers and aligning the pixels with the same positions in each layer. The digits indicate the color of the corresponding pixel: 0 is black, 1 is white, and 2 is transparent.
The layers are rendered with the first layer in front and the last layer in back. So, if a given position has a transparent pixel in the first and second layers, a black pixel in the third layer, and a white pixel in the fourth layer, the final image would have a black pixel at that position.
For example, given an image 2 pixels wide and 2 pixels tall, the image data 0222112222120000 corresponds to the following image layers:
Layer 1: 02
22
Layer 2: 11
22
Layer 3: 22
12
Layer 4: 00
00
Then, the full image can be found by determining the top visible pixel in each position:
The top-left pixel is black because the top layer is 0.
The top-right pixel is white because the top layer is 2 (transparent), but the second layer is 1.
The bottom-left pixel is white because the top two layers are 2, but the third layer is 1.
The bottom-right pixel is black because the only visible pixel in that position is 0 (from layer 4).
So, the final image looks like this:
01
10
What message is produced after decoding your image?
Your puzzle answer was JAFRA.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day09/input.txt
-1
View File
@@ -1 +0,0 @@
1102,34463338,34463338,63,1007,63,34463338,63,1005,63,53,1101,3,0,1000,109,988,209,12,9,1000,209,6,209,3,203,0,1008,1000,1,63,1005,63,65,1008,1000,2,63,1005,63,904,1008,1000,0,63,1005,63,58,4,25,104,0,99,4,0,104,0,99,4,17,104,0,99,0,0,1101,27,0,1014,1101,286,0,1023,1102,1,35,1018,1102,20,1,1000,1101,26,0,1010,1101,0,289,1022,1102,1,30,1019,1102,734,1,1025,1102,1,31,1012,1101,25,0,1001,1102,1,1,1021,1101,0,36,1002,1101,0,527,1028,1101,895,0,1026,1102,1,23,1016,1101,21,0,1003,1102,22,1,1011,1102,1,522,1029,1102,1,892,1027,1102,1,0,1020,1102,1,28,1015,1102,38,1,1006,1101,0,32,1008,1101,743,0,1024,1101,0,37,1007,1102,1,24,1013,1102,1,33,1009,1102,39,1,1004,1102,1,34,1005,1102,1,29,1017,109,19,21102,40,1,-3,1008,1016,40,63,1005,63,203,4,187,1106,0,207,1001,64,1,64,1002,64,2,64,109,-7,2101,0,-7,63,1008,63,32,63,1005,63,227,1106,0,233,4,213,1001,64,1,64,1002,64,2,64,109,-3,2108,37,-2,63,1005,63,255,4,239,1001,64,1,64,1105,1,255,1002,64,2,64,109,11,21108,41,40,-6,1005,1014,275,1001,64,1,64,1106,0,277,4,261,1002,64,2,64,109,10,2105,1,-7,1105,1,295,4,283,1001,64,1,64,1002,64,2,64,109,-27,1201,-2,0,63,1008,63,25,63,1005,63,321,4,301,1001,64,1,64,1105,1,321,1002,64,2,64,109,15,21107,42,41,0,1005,1018,341,1001,64,1,64,1106,0,343,4,327,1002,64,2,64,109,-25,2108,20,10,63,1005,63,359,1105,1,365,4,349,1001,64,1,64,1002,64,2,64,109,12,2107,35,0,63,1005,63,385,1001,64,1,64,1106,0,387,4,371,1002,64,2,64,109,4,21101,43,0,6,1008,1015,43,63,1005,63,409,4,393,1106,0,413,1001,64,1,64,1002,64,2,64,109,9,21101,44,0,-8,1008,1010,46,63,1005,63,437,1001,64,1,64,1106,0,439,4,419,1002,64,2,64,109,5,21108,45,45,-4,1005,1019,457,4,445,1106,0,461,1001,64,1,64,1002,64,2,64,109,-22,2102,1,7,63,1008,63,33,63,1005,63,481,1106,0,487,4,467,1001,64,1,64,1002,64,2,64,109,14,21102,46,1,-1,1008,1014,43,63,1005,63,507,1106,0,513,4,493,1001,64,1,64,1002,64,2,64,109,12,2106,0,1,4,519,1106,0,531,1001,64,1,64,1002,64,2,64,109,-17,1205,10,547,1001,64,1,64,1106,0,549,4,537,1002,64,2,64,109,-8,1202,-2,1,63,1008,63,17,63,1005,63,569,1105,1,575,4,555,1001,64,1,64,1002,64,2,64,109,23,1206,-5,593,4,581,1001,64,1,64,1105,1,593,1002,64,2,64,109,-14,1208,-8,24,63,1005,63,613,1001,64,1,64,1105,1,615,4,599,1002,64,2,64,109,-2,1207,-1,33,63,1005,63,633,4,621,1105,1,637,1001,64,1,64,1002,64,2,64,109,2,21107,47,48,5,1005,1016,659,4,643,1001,64,1,64,1105,1,659,1002,64,2,64,109,-11,1208,8,32,63,1005,63,681,4,665,1001,64,1,64,1106,0,681,1002,64,2,64,109,2,2101,0,0,63,1008,63,36,63,1005,63,703,4,687,1106,0,707,1001,64,1,64,1002,64,2,64,109,12,1206,7,719,1106,0,725,4,713,1001,64,1,64,1002,64,2,64,109,2,2105,1,8,4,731,1001,64,1,64,1106,0,743,1002,64,2,64,109,-21,2102,1,9,63,1008,63,39,63,1005,63,769,4,749,1001,64,1,64,1105,1,769,1002,64,2,64,109,11,1201,-3,0,63,1008,63,24,63,1005,63,793,1001,64,1,64,1105,1,795,4,775,1002,64,2,64,109,20,1205,-5,809,4,801,1105,1,813,1001,64,1,64,1002,64,2,64,109,-23,1207,4,36,63,1005,63,833,1001,64,1,64,1105,1,835,4,819,1002,64,2,64,109,-3,2107,33,5,63,1005,63,853,4,841,1106,0,857,1001,64,1,64,1002,64,2,64,109,16,1202,-9,1,63,1008,63,37,63,1005,63,879,4,863,1105,1,883,1001,64,1,64,1002,64,2,64,109,12,2106,0,-1,1105,1,901,4,889,1001,64,1,64,4,64,99,21101,0,27,1,21101,0,915,0,1106,0,922,21201,1,48476,1,204,1,99,109,3,1207,-2,3,63,1005,63,964,21201,-2,-1,1,21101,0,942,0,1105,1,922,21202,1,1,-1,21201,-2,-3,1,21101,0,957,0,1105,1,922,22201,1,-1,-2,1106,0,968,21202,-2,1,-2,109,-3,2106,0,0
2019/day10/input.txt
-21
View File
@@ -1,21 +0,0 @@
...###.#########.####
.######.###.###.##...
####.########.#####.#
########.####.##.###.
####..#.####.#.#.##..
#.################.##
..######.##.##.#####.
#.####.#####.###.#.##
#####.#########.#####
#####.##..##..#.#####
##.######....########
.#######.#.#########.
.#.##.#.#.#.##.###.##
######...####.#.#.###
###############.#.###
#.#####.##..###.##.#.
##..##..###.#.#######
#..#..########.#.##..
#.#.######.##.##...##
.#.##.#####.#..#####.
#.#.##########..#.##.
2019/day10/prompt.txt
-161
View File
@@ -1,161 +0,0 @@
--- Day 10: Monitoring Station ---
You fly into the asteroid belt and reach the Ceres monitoring station. The Elves here have an emergency: they're having trouble tracking all of the asteroids and can't be sure they're safe.
The Elves would like to build a new monitoring station in a nearby area of space; they hand you a map of all of the asteroids in that region (your puzzle input).
The map indicates whether each position is empty (.) or contains an asteroid (#). The asteroids are much smaller than they appear on the map, and every asteroid is exactly in the center of its marked position. The asteroids can be described with X,Y coordinates where X is the distance from the left edge and Y is the distance from the top edge (so the top-left corner is 0,0 and the position immediately to its right is 1,0).
Your job is to figure out which asteroid would be the best place to build a new monitoring station. A monitoring station can detect any asteroid to which it has direct line of sight - that is, there cannot be another asteroid exactly between them. This line of sight can be at any angle, not just lines aligned to the grid or diagonally. The best location is the asteroid that can detect the largest number of other asteroids.
For example, consider the following map:
.#..#
.....
#####
....#
...##
The best location for a new monitoring station on this map is the highlighted asteroid at 3,4 because it can detect 8 asteroids, more than any other location. (The only asteroid it cannot detect is the one at 1,0; its view of this asteroid is blocked by the asteroid at 2,2.) All other asteroids are worse locations; they can detect 7 or fewer other asteroids. Here is the number of other asteroids a monitoring station on each asteroid could detect:
.7..7
.....
67775
....7
...87
Here is an asteroid (#) and some examples of the ways its line of sight might be blocked. If there were another asteroid at the location of a capital letter, the locations marked with the corresponding lowercase letter would be blocked and could not be detected:
#.........
...A......
...B..a...
.EDCG....a
..F.c.b...
.....c....
..efd.c.gb
.......c..
....f...c.
...e..d..c
Here are some larger examples:
Best is 5,8 with 33 other asteroids detected:
......#.#.
#..#.#....
..#######.
.#.#.###..
.#..#.....
..#....#.#
#..#....#.
.##.#..###
##...#..#.
.#....####
Best is 1,2 with 35 other asteroids detected:
#.#...#.#.
.###....#.
.#....#...
##.#.#.#.#
....#.#.#.
.##..###.#
..#...##..
..##....##
......#...
.####.###.
Best is 6,3 with 41 other asteroids detected:
.#..#..###
####.###.#
....###.#.
..###.##.#
##.##.#.#.
....###..#
..#.#..#.#
#..#.#.###
.##...##.#
.....#.#..
Best is 11,13 with 210 other asteroids detected:
.#..##.###...#######
##.############..##.
.#.######.########.#
.###.#######.####.#.
#####.##.#.##.###.##
..#####..#.#########
####################
#.####....###.#.#.##
##.#################
#####.##.###..####..
..######..##.#######
####.##.####...##..#
.#####..#.######.###
##...#.##########...
#.##########.#######
.####.#.###.###.#.##
....##.##.###..#####
.#.#.###########.###
#.#.#.#####.####.###
###.##.####.##.#..##
Find the best location for a new monitoring station. How many other asteroids can be detected from that location?
Your puzzle answer was 227.
--- Part Two ---
Once you give them the coordinates, the Elves quickly deploy an Instant Monitoring Station to the location and discover the worst: there are simply too many asteroids.
The only solution is complete vaporization by giant laser.
Fortunately, in addition to an asteroid scanner, the new monitoring station also comes equipped with a giant rotating laser perfect for vaporizing asteroids. The laser starts by pointing up and always rotates clockwise, vaporizing any asteroid it hits.
If multiple asteroids are exactly in line with the station, the laser only has enough power to vaporize one of them before continuing its rotation. In other words, the same asteroids that can be detected can be vaporized, but if vaporizing one asteroid makes another one detectable, the newly-detected asteroid won't be vaporized until the laser has returned to the same position by rotating a full 360 degrees.
For example, consider the following map, where the asteroid with the new monitoring station (and laser) is marked X:
.#....#####...#..
##...##.#####..##
##...#...#.#####.
..#.....X...###..
..#.#.....#....##
The first nine asteroids to get vaporized, in order, would be:
.#....###24...#..
##...##.13#67..9#
##...#...5.8####.
..#.....X...###..
..#.#.....#....##
Note that some asteroids (the ones behind the asteroids marked 1, 5, and 7) won't have a chance to be vaporized until the next full rotation. The laser continues rotating; the next nine to be vaporized are:
.#....###.....#..
##...##...#.....#
##...#......1234.
..#.....X...5##..
..#.9.....8....76
The next nine to be vaporized are then:
.8....###.....#..
56...9#...#.....#
34...7...........
..2.....X....##..
..1..............
Finally, the laser completes its first full rotation (1 through 3), a second rotation (4 through 8), and vaporizes the last asteroid (9) partway through its third rotation:
......234.....6..
......1...5.....7
.................
........X....89..
.................
In the large example above (the one with the best monitoring station location at 11,13):
The 1st asteroid to be vaporized is at 11,12.
The 2nd asteroid to be vaporized is at 12,1.
The 3rd asteroid to be vaporized is at 12,2.
The 10th asteroid to be vaporized is at 12,8.
The 20th asteroid to be vaporized is at 16,0.
The 50th asteroid to be vaporized is at 16,9.
The 100th asteroid to be vaporized is at 10,16.
The 199th asteroid to be vaporized is at 9,6.
The 200th asteroid to be vaporized is at 8,2.
The 201st asteroid to be vaporized is at 10,9.
The 299th and final asteroid to be vaporized is at 11,1.
The Elves are placing bets on which will be the 200th asteroid to be vaporized. Win the bet by determining which asteroid that will be; what do you get if you multiply its X coordinate by 100 and then add its Y coordinate? (For example, 8,2 becomes 802.)
Your puzzle answer was 604.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day11/input.txt
-1
View File
@@ -1 +0,0 @@
3,8,1005,8,329,1106,0,11,0,0,0,104,1,104,0,3,8,102,-1,8,10,1001,10,1,10,4,10,1008,8,0,10,4,10,1002,8,1,29,2,1102,1,10,1,1009,16,10,2,4,4,10,1,9,5,10,3,8,1002,8,-1,10,101,1,10,10,4,10,108,0,8,10,4,10,101,0,8,66,2,106,7,10,1006,0,49,3,8,1002,8,-1,10,101,1,10,10,4,10,108,1,8,10,4,10,1002,8,1,95,1006,0,93,3,8,102,-1,8,10,1001,10,1,10,4,10,108,1,8,10,4,10,102,1,8,120,1006,0,61,2,1108,19,10,2,1003,2,10,1006,0,99,3,8,1002,8,-1,10,1001,10,1,10,4,10,1008,8,0,10,4,10,101,0,8,157,3,8,102,-1,8,10,1001,10,1,10,4,10,1008,8,1,10,4,10,1001,8,0,179,2,1108,11,10,1,1102,19,10,3,8,102,-1,8,10,1001,10,1,10,4,10,1008,8,1,10,4,10,101,0,8,209,2,108,20,10,3,8,1002,8,-1,10,101,1,10,10,4,10,108,1,8,10,4,10,101,0,8,234,3,8,102,-1,8,10,101,1,10,10,4,10,108,0,8,10,4,10,1002,8,1,256,2,1102,1,10,1006,0,69,2,108,6,10,2,4,13,10,3,8,102,-1,8,10,101,1,10,10,4,10,1008,8,0,10,4,10,1002,8,1,294,1,1107,9,10,1006,0,87,2,1006,8,10,2,1001,16,10,101,1,9,9,1007,9,997,10,1005,10,15,99,109,651,104,0,104,1,21101,387395195796,0,1,21101,346,0,0,1105,1,450,21101,0,48210129704,1,21101,0,357,0,1105,1,450,3,10,104,0,104,1,3,10,104,0,104,0,3,10,104,0,104,1,3,10,104,0,104,1,3,10,104,0,104,0,3,10,104,0,104,1,21101,0,46413147328,1,21102,404,1,0,1106,0,450,21102,179355823323,1,1,21101,415,0,0,1105,1,450,3,10,104,0,104,0,3,10,104,0,104,0,21102,1,838345843476,1,21101,0,438,0,1105,1,450,21101,709475709716,0,1,21101,449,0,0,1105,1,450,99,109,2,22102,1,-1,1,21102,40,1,2,21101,0,481,3,21101,0,471,0,1105,1,514,109,-2,2105,1,0,0,1,0,0,1,109,2,3,10,204,-1,1001,476,477,492,4,0,1001,476,1,476,108,4,476,10,1006,10,508,1101,0,0,476,109,-2,2106,0,0,0,109,4,2101,0,-1,513,1207,-3,0,10,1006,10,531,21101,0,0,-3,21201,-3,0,1,21201,-2,0,2,21101,1,0,3,21101,550,0,0,1105,1,555,109,-4,2106,0,0,109,5,1207,-3,1,10,1006,10,578,2207,-4,-2,10,1006,10,578,21201,-4,0,-4,1105,1,646,22101,0,-4,1,21201,-3,-1,2,21202,-2,2,3,21101,597,0,0,1105,1,555,22102,1,1,-4,21101,0,1,-1,2207,-4,-2,10,1006,10,616,21101,0,0,-1,22202,-2,-1,-2,2107,0,-3,10,1006,10,638,22102,1,-1,1,21101,638,0,0,106,0,513,21202,-2,-1,-2,22201,-4,-2,-4,109,-5,2106,0,0
2019/day11/prompt.txt
-76
View File
@@ -1,76 +0,0 @@
--- Day 11: Space Police ---
On the way to Jupiter, you're pulled over by the Space Police.
"Attention, unmarked spacecraft! You are in violation of Space Law! All spacecraft must have a clearly visible registration identifier! You have 24 hours to comply or be sent to Space Jail!"
Not wanting to be sent to Space Jail, you radio back to the Elves on Earth for help. Although it takes almost three hours for their reply signal to reach you, they send instructions for how to power up the emergency hull painting robot and even provide a small Intcode program (your puzzle input) that will cause it to paint your ship appropriately.
There's just one problem: you don't have an emergency hull painting robot.
You'll need to build a new emergency hull painting robot. The robot needs to be able to move around on the grid of square panels on the side of your ship, detect the color of its current panel, and paint its current panel black or white. (All of the panels are currently black.)
The Intcode program will serve as the brain of the robot. The program uses input instructions to access the robot's camera: provide 0 if the robot is over a black panel or 1 if the robot is over a white panel. Then, the program will output two values:
First, it will output a value indicating the color to paint the panel the robot is over: 0 means to paint the panel black, and 1 means to paint the panel white.
Second, it will output a value indicating the direction the robot should turn: 0 means it should turn left 90 degrees, and 1 means it should turn right 90 degrees.
After the robot turns, it should always move forward exactly one panel. The robot starts facing up.
The robot will continue running for a while like this and halt when it is finished drawing. Do not restart the Intcode computer inside the robot during this process.
For example, suppose the robot is about to start running. Drawing black panels as ., white panels as #, and the robot pointing the direction it is facing (< ^ > v), the initial state and region near the robot looks like this:
.....
.....
..^..
.....
.....
The panel under the robot (not visible here because a ^ is shown instead) is also black, and so any input instructions at this point should be provided 0. Suppose the robot eventually outputs 1 (paint white) and then 0 (turn left). After taking these actions and moving forward one panel, the region now looks like this:
.....
.....
.<#..
.....
.....
Input instructions should still be provided 0. Next, the robot might output 0 (paint black) and then 0 (turn left):
.....
.....
..#..
.v...
.....
After more outputs (1,0, 1,0):
.....
.....
..^..
.##..
.....
The robot is now back where it started, but because it is now on a white panel, input instructions should be provided 1. After several more outputs (0,1, 1,0, 1,0), the area looks like this:
.....
..<#.
...#.
.##..
.....
Before you deploy the robot, you should probably have an estimate of the area it will cover: specifically, you need to know the number of panels it paints at least once, regardless of color. In the example above, the robot painted 6 panels at least once. (It painted its starting panel twice, but that panel is still only counted once; it also never painted the panel it ended on.)
Build a new emergency hull painting robot and run the Intcode program on it. How many panels does it paint at least once?
Your puzzle answer was 2594.
--- Part Two ---
You're not sure what it's trying to paint, but it's definitely not a registration identifier. The Space Police are getting impatient.
Checking your external ship cameras again, you notice a white panel marked "emergency hull painting robot starting panel". The rest of the panels are still black, but it looks like the robot was expecting to start on a white panel, not a black one.
Based on the Space Law Space Brochure that the Space Police attached to one of your windows, a valid registration identifier is always eight capital letters. After starting the robot on a single white panel instead, what registration identifier does it paint on your hull?
Your puzzle answer was AKERJFHK.
Both parts of this puzzle are complete! They provide two gold stars: **
At this point, you should return to your Advent calendar and try another puzzle.
If you still want to see it, you can get your puzzle input.
You can also [Share] this puzzle.
2019/day12/input.txt
-4
View File
@@ -1,4 +0,0 @@
<x=14, y=2, z=8>
<x=7, y=4, z=10>
<x=1, y=17, z=16>
<x=-4, y=-1, z=1>
2019/day12/prompt.txt
-223
View File
@@ -1,223 +0,0 @@
--- Day 12: The N-Body Problem ---
The space near Jupiter is not a very safe place; you need to be careful of a big distracting red spot, extreme radiation, and a whole lot of moons swirling around. You decide to start by tracking the four largest moons: Io, Europa, Ganymede, and Callisto.
After a brief scan, you calculate the position of each moon (your puzzle input). You just need to simulate their motion so you can avoid them.
Each moon has a 3-dimensional position (x, y, and z) and a 3-dimensional velocity. The position of each moon is given in your scan; the x, y, and z velocity of each moon starts at 0.
Simulate the motion of the moons in time steps. Within each time step, first update the velocity of every moon by applying gravity. Then, once all moons' velocities have been updated, update the position of every moon by applying velocity. Time progresses by one step once all of the positions are updated.
To apply gravity, consider every pair of moons. On each axis (x, y, and z), the velocity of each moon changes by exactly +1 or -1 to pull the moons together. For example, if Ganymede has an x position of 3, and Callisto has a x position of 5, then Ganymede's x velocity changes by +1 (because 5 > 3) and Callisto's x velocity changes by -1 (because 3 < 5). However, if the positions on a given axis are the same, the velocity on that axis does not change for that pair of moons.
Once all gravity has been applied, apply velocity: simply add the velocity of each moon to its own position. For example, if Europa has a position of x=1, y=2, z=3 and a velocity of x=-2, y=0,z=3, then its new position would be x=-1, y=2, z=6. This process does not modify the velocity of any moon.
For example, suppose your scan reveals the following positions:
<x=-1, y=0, z=2>
<x=2, y=-10, z=-7>
<x=4, y=-8, z=8>
<x=3, y=5, z=-1>
Simulating the motion of these moons would produce the following:
After 0 steps:
pos=<x=-1, y= 0, z= 2>, vel=<x= 0, y= 0, z= 0>
pos=<x= 2, y=-10, z=-7>, vel=<x= 0, y= 0, z= 0>
pos=<x= 4, y= -8, z= 8>, vel=<x= 0, y= 0, z= 0>
pos=<x= 3, y= 5, z=-1>, vel=<x= 0, y= 0, z= 0>
After 1 step:
pos=<x= 2, y=-1, z= 1>, vel=<x= 3, y=-1, z=-1>
pos=<x= 3, y=-7, z=-4>, vel=<x= 1, y= 3, z= 3>
pos=<x= 1, y=-7, z= 5>, vel=<x=-3, y= 1, z=-3>
pos=<x= 2, y= 2, z= 0>, vel=<x=-1, y=-3, z= 1>
After 2 steps:
pos=<x= 5, y=-3, z=-1>, vel=<x= 3, y=-2, z=-2>
pos=<x= 1, y=-2, z= 2>, vel=<x=-2, y= 5, z= 6>
pos=<x= 1, y=-4, z=-1>, vel=<x= 0, y= 3, z=-6>
pos=<x= 1, y=-4, z= 2>, vel=<x=-1, y=-6, z= 2>
After 3 steps:
pos=<x= 5, y=-6, z=-1>, vel=<x= 0, y=-3, z= 0>
pos=<x= 0, y= 0, z= 6>, vel=<x=-1, y= 2, z= 4>
pos=<x= 2, y= 1, z=-5>, vel=<x= 1, y= 5, z=-4>
pos=<x= 1, y=-8, z= 2>, vel=<x= 0, y=-4, z= 0>
After 4 steps:
pos=<x= 2, y=-8, z= 0>, vel=<x=-3, y=-2, z= 1>
pos=<x= 2, y= 1, z= 7>, vel=<x= 2, y= 1, z= 1>
pos=<x= 2, y= 3, z=-6>, vel=<x= 0, y= 2, z=-1>
pos=<x= 2, y=-9, z= 1>, vel=<x= 1, y=-1, z=-1>
After 5 steps:
pos=<x=-1, y=-9, z= 2>, vel=<x=-3, y=-1, z= 2>
pos=<x= 4, y= 1, z= 5>, vel=<x= 2, y= 0, z=-2>
pos=<x= 2, y= 2, z=-4>, vel=<x= 0, y=-1, z= 2>
pos=<x= 3, y=-7, z=-1>, vel=<x= 1, y= 2, z=-2>
After 6 steps:
pos=<x=-1, y=-7, z= 3>, vel=<x= 0, y= 2, z= 1>
pos=<x= 3, y= 0, z= 0>, vel=<x=-1, y=-1, z=-5>
pos=<x= 3, y=-2, z= 1>, vel=<x= 1, y=-4, z= 5>
pos=<x= 3, y=-4, z=-2>, vel=<x= 0, y= 3, z=-1>
After 7 steps:
pos=<x= 2, y=-2, z= 1>, vel=<x= 3, y= 5, z=-2>
pos=<x= 1, y=-4, z=-4>, vel=<x=-2, y=-4, z=-4>
pos=<x= 3, y=-7, z= 5>, vel=<x= 0, y=-5, z= 4>
pos=<x= 2, y= 0, z= 0>, vel=<x=-1, y= 4, z= 2>
After 8 steps:
pos=<x= 5, y= 2, z=-2>, vel=<x= 3, y= 4, z=-3>
pos=<x= 2, y=-7, z=-5>, vel=<x= 1, y=-3, z=-1>
pos=<x= 0, y=-9, z= 6>, vel=<x=-3, y=-2, z= 1>
pos=<x= 1, y= 1, z= 3>, vel=<x=-1, y= 1, z= 3>
After 9 steps:
pos=<x= 5, y= 3, z=-4>, vel=<x= 0, y= 1, z=-2>
pos=<x= 2, y=-9, z=-3>, vel=<x= 0, y=-2, z= 2>
pos=<x= 0, y=-8, z= 4>, vel=<x= 0, y= 1, z=-2>
pos=<x= 1, y= 1, z= 5>, vel=<x= 0, y= 0, z= 2>
After 10 steps:
pos=<x= 2, y= 1, z=-3>, vel=<x=-3, y=-2, z= 1>
pos=<x= 1, y=-8, z= 0>, vel=<x=-1, y= 1, z= 3>
pos=<x= 3, y=-6, z= 1>, vel=<x= 3, y= 2, z=-3>
pos=<x= 2, y= 0, z= 4>, vel=<x= 1, y=-1, z=-1>
Then, it might help to calculate the total energy in the system. The total energy for a single moon is its potential energy multiplied by its kinetic energy. A moon's potential energy is the sum of the absolute values of its x, y, and z position coordinates. A moon's kinetic energy is the sum of the absolute values of its velocity coordinates. Below, each line shows the calculations for a moon's potential energy (pot), kinetic energy (kin), and total energy:
Energy after 10 steps:
pot: 2 + 1 + 3 = 6; kin: 3 + 2 + 1 = 6; total: 6 * 6 = 36
pot: 1 + 8 + 0 = 9; kin: 1 + 1 + 3 = 5; total: 9 * 5 = 45
pot: 3 + 6 + 1 = 10; kin: 3 + 2 + 3 = 8; total: 10 * 8 = 80
pot: 2 + 0 + 4 = 6; kin: 1 + 1 + 1 = 3; total: 6 * 3 = 18
Sum of total energy: 36 + 45 + 80 + 18 = 179
In the above example, adding together the total energy for all moons after 10 steps produces the total energy in the system, 179.
Here's a second example:
<x=-8, y=-10, z=0>
<x=5, y=5, z=10>
<x=2, y=-7, z=3>
<x=9, y=-8, z=-3>
Every ten steps of simulation for 100 steps produces:
After 0 steps:
pos=<x= -8, y=-10, z= 0>, vel=<x= 0, y= 0, z= 0>
pos=<x= 5, y= 5, z= 10>, vel=<x= 0, y= 0, z= 0>
pos=<x= 2, y= -7, z= 3>, vel=<x= 0, y= 0, z= 0>
pos=<x= 9, y= -8, z= -3>, vel=<x= 0, y= 0, z= 0>
After 10 steps:
pos=<x= -9, y=-10, z= 1>, vel=<x= -2, y= -2, z= -1>
pos=<x= 4, y= 10, z= 9>, vel=<x= -3, y= 7, z= -2>
pos=<x= 8, y=-10, z= -3>, vel=<x= 5, y= -1, z= -2>
pos=<x= 5, y=-10, z= 3>, vel=<x= 0, y= -4, z= 5>
After 20 steps:
pos=<x=-10, y= 3, z= -4>, vel=<x= -5, y= 2, z= 0>
pos=<x= 5, y=-25, z= 6>, vel=<x= 1, y= 1, z= -4>
pos=<x= 13, y= 1, z= 1>, vel=<x= 5, y= -2, z= 2>
pos=<x= 0, y= 1, z= 7>, vel=<x= -1, y= -1, z= 2>
After 30 steps:
pos=<x= 15, y= -6, z= -9>, vel=<x= -5, y= 4, z= 0>
pos=<x= -4, y=-11, z= 3>, vel=<x= -3, y=-10, z= 0>
pos=<x= 0, y= -1, z= 11>, vel=<x= 7, y= 4, z= 3>
pos=<x= -3, y= -2, z= 5>, vel=<x= 1, y= 2, z= -3>
After 40 steps:
pos=<x= 14, y=-12, z= -4>, vel=<x= 11, y= 3, z= 0>
pos=<x= -1, y= 18, z= 8>, vel=<x= -5, y= 2, z= 3>
pos=<x= -5, y=-14, z= 8>, vel=<x= 1, y= -2, z= 0>
pos=<x= 0, y=-12, z= -2>, vel=<x= -7, y= -3, z= -3>
After 50 steps:
pos=<x=-23, y= 4, z= 1>, vel=<x= -7, y= -1, z= 2>
pos=<x= 20, y=-31, z= 13>, vel=<x= 5, y= 3, z= 4>
pos=<x= -4, y= 6, z= 1>, vel=<x= -1, y= 1, z= -3>
pos=<x= 15, y= 1, z= -5>, vel=<x= 3, y= -3, z= -3>
After 60 steps:
pos=<x= 36, y=-10, z= 6>, vel=<x= 5, y= 0, z= 3>
pos=<x=-18, y= 10, z= 9>, vel=<x= -3, y= -7, z= 5>
pos=<x= 8, y=-12, z= -3>, vel=<x= -2, y= 1, z= -7>
pos=<x=-18, y= -8, z= -2>, vel=<x= 0, y= 6, z= -1>
After 70 steps:
pos=<x=-33, y= -6, z= 5>, vel=<x= -5, y= -4, z= 7>
pos=<x= 13, y= -9, z= 2>, vel=<x= -2, y= 11, z= 3>
pos=<x= 11, y= -8, z= 2>, vel=<x= 8, y= -6, z= -7>
pos=<x= 17, y= 3, z= 1>, vel=<x= -1, y= -1, z= -3>
After 80 steps:
pos=<x= 30, y= -8, z= 3>, vel=<x= 3, y= 3, z= 0>
pos=<x= -2, y= -4, z= 0>, vel=<x= 4, y=-13, z= 2>
pos=<x=-18, y= -7, z= 15>, vel=<x= -8, y= 2, z= -2>
pos=<x= -2, y= -1, z= -8>, vel=<x= 1, y= 8, z= 0>
After 90 steps:
pos=<x=-25, y= -1, z= 4>, vel=<x= 1, y= -3, z= 4>
pos=<x= 2, y= -9, z= 0>, vel=<x= -3, y= 13, z= -1>
pos=<x= 32, y= -8, z= 14>, vel=<x= 5, y= -4, z= 6>
pos=<x= -1, y= -2, z= -8>, vel=<x= -3, y= -6, z= -9>
After 100 steps:
pos=<x= 8, y=-12, z= -9>, vel=<x= -7, y= 3, z= 0>
pos=<x= 13, y= 16, z= -3>, vel=<x= 3, y=-11, z= -5>
pos=<x=-29, y=-11, z= -1>, vel=<x= -3, y= 7, z= 4>
pos=<x= 16, y=-13, z= 23>, vel=<x= 7, y= 1, z= 1>
Energy after 100 steps:
pot: 8 + 12 + 9 = 29; kin: 7 + 3 + 0 = 10; total: 29 * 10 = 290
pot: 13 + 16 + 3 = 32; kin: 3 + 11 + 5 = 19; total: 32 * 19 = 608
pot: 29 + 11 + 1 = 41; kin: 3 + 7 + 4 = 14; total: 41 * 14 = 574
pot: 16 + 13 + 23 = 52; kin: 7 + 1 + 1 = 9; total: 52 * 9 = 468
Sum of total energy: 290 + 608 + 574 + 468 = 1940
What is the total energy in the system after simulating the moons given in your scan for 1000 steps?
Your puzzle answer was 9139.
--- Part Two ---
All this drifting around in space makes you wonder about the nature of the universe. Does history really repeat itself? You're curious whether the moons will ever return to a previous state.
Determine the number of steps that must occur before all of the moons' positions and velocities exactly match a previous point in time.
For example, the first example above takes 2772 steps before they exactly match a previous point in time; it eventually returns to the initial state:
After 0 steps:
pos=<x= -1, y= 0, z= 2>, vel=<x= 0, y= 0, z= 0>
pos=<x= 2, y=-10, z= -7>, vel=<x= 0, y= 0, z= 0>
pos=<x= 4, y= -8, z= 8>, vel=<x= 0, y= 0, z= 0>
pos=<x= 3, y= 5, z= -1>, vel=<x= 0, y= 0, z= 0>
After 2770 steps:
pos=<x= 2, y= -1, z= 1>, vel=<x= -3, y= 2, z= 2>
pos=<x= 3, y= -7, z= -4>, vel=<x= 2, y= -5, z= -6>
pos=<x= 1, y= -7, z= 5>, vel=<x= 0, y= -3, z= 6>
pos=<x= 2, y= 2, z= 0>, vel=<x= 1, y= 6, z= -2>
After 2771 steps:
pos=<x= -1, y= 0, z= 2>, vel=<x= -3, y= 1, z= 1>
pos=<x= 2, y=-10, z= -7>, vel=<x= -1, y= -3, z= -3>
pos=<x= 4, y= -8, z= 8>, vel=<x= 3, y= -1, z= 3>
pos=<x= 3, y= 5, z= -1>, vel=<x= 1, y= 3, z= -1>
After 2772 steps:
pos=<x= -1, y= 0, z= 2>, vel=<x= 0, y= 0, z= 0>
pos=<x= 2, y=-10, z= -7>, vel=<x= 0, y= 0, z= 0>
pos=<x= 4, y= -8, z= 8>, vel=<x= 0, y= 0, z= 0>
pos=<x= 3, y= 5, z= -1>, vel=<x= 0, y= 0, z= 0>
Of course, the universe might last for a very long time before repeating. Here's a copy of the second example from above:
<x=-8, y=-10, z=0>
<x=5, y=5, z=10>
<x=2, y=-7, z=3>
<x=9, y=-8, z=-3>
This set of initial positions takes 4686774924 steps before it repeats a previous state! Clearly, you might need to find a more efficient way to simulate the universe.
How many steps does it take to reach the first state that exactly matches a previous state?
Your puzzle answer was 420788524631496.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day13/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day13/prompt.txt
-34
View File
@@ -1,34 +0,0 @@
--- Day 13: Care Package ---
As you ponder the solitude of space and the ever-increasing three-hour roundtrip for messages between you and Earth, you notice that the Space Mail Indicator Light is blinking. To help keep you sane, the Elves have sent you a care package.
It's a new game for the ship's arcade cabinet! Unfortunately, the arcade is all the way on the other end of the ship. Surely, it won't be hard to build your own - the care package even comes with schematics.
The arcade cabinet runs Intcode software like the game the Elves sent (your puzzle input). It has a primitive screen capable of drawing square tiles on a grid. The software draws tiles to the screen with output instructions: every three output instructions specify the x position (distance from the left), y position (distance from the top), and tile id. The tile id is interpreted as follows:
0 is an empty tile. No game object appears in this tile.
1 is a wall tile. Walls are indestructible barriers.
2 is a block tile. Blocks can be broken by the ball.
3 is a horizontal paddle tile. The paddle is indestructible.
4 is a ball tile. The ball moves diagonally and bounces off objects.
For example, a sequence of output values like 1,2,3,6,5,4 would draw a horizontal paddle tile (1 tile from the left and 2 tiles from the top) and a ball tile (6 tiles from the left and 5 tiles from the top).
Start the game. How many block tiles are on the screen when the game exits?
Your puzzle answer was 260.
--- Part Two ---
The game didn't run because you didn't put in any quarters. Unfortunately, you did not bring any quarters. Memory address 0 represents the number of quarters that have been inserted; set it to 2 to play for free.
The arcade cabinet has a joystick that can move left and right. The software reads the position of the joystick with input instructions:
If the joystick is in the neutral position, provide 0.
If the joystick is tilted to the left, provide -1.
If the joystick is tilted to the right, provide 1.
The arcade cabinet also has a segment display capable of showing a single number that represents the player's current score. When three output instructions specify X=-1, Y=0, the third output instruction is not a tile; the value instead specifies the new score to show in the segment display. For example, a sequence of output values like -1,0,12345 would show 12345 as the player's current score.
Beat the game by breaking all the blocks. What is your score after the last block is broken?
Your puzzle answer was 12952.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day14/input.txt
-55
View File
@@ -1,55 +0,0 @@
13 RXWQR => 4 JXCXB
7 FDGDX => 7 XRWJ
3 JBVN, 25 JFRXJ => 3 TPDSB
13 HZDWS, 11 RZNJR => 3 SVFT
5 FDGDX, 4 RZNJR, 41 ZGXGP => 8 LBVM
1 LJDRB => 9 RXWQR
2 RDPWQ => 8 JBVN
2 CZCB => 8 CXHK
4 JXCXB, 1 FPQRV => 5 TCBSQ
6 FDGDX => 8 TWGNB
1 RJBTL => 5 VRVDQ
2 XRWJ, 3 HZDWS, 12 LBVM => 6 KSJD
15 HPXST, 1 KMKR, 7 SLTX, 1 PRWD, 14 RCLB, 31 TPDSB, 3 GWXJP, 3 TPQZ => 8 XRLZR
1 RBLT, 2 RTFKN, 1 CZCB => 8 DNRP
131 ORE => 8 TFGJ
2 JFRXJ, 1 VRVDQ, 26 TWGNB => 5 CFPZ
2 SMPW, 1 TWGNB => 8 RZNJR
20 HRZP => 6 RDPWQ
1 RCLB, 4 GJNK, 4 QGJL => 4 HZDWS
7 CXHK, 2 XTMRV, 6 WSNPZ, 12 LQXCP, 19 PMWJ, 17 GJNK, 26 XRLZR, 36 LWFQ => 1 FUEL
131 ORE => 8 KMKR
1 LJDRB, 12 TFGJ, 10 RXWQR => 7 RPKZ
10 RVXT, 1 RDPWQ => 8 JFRXJ
1 QXBTX => 9 TPQZ
1 ZGXGP => 5 FZGF
1 RTFKN, 1 DNRP => 2 FDGDX
19 CZCB, 1 RBLT => 4 SMPW
2 DNRP, 1 SMPW => 9 RWSH
1 ZGXGP, 5 TCBSQ, 22 SMPW => 5 GWXJP
1 HBSKF => 3 LQXCP
1 ZGXGP, 2 KSJD, 9 CFPZ => 7 CLGXQ
186 ORE => 8 LJDRB
1 TPQZ, 2 HBSKF => 1 QGJL
8 FZGF, 6 FDGDX => 3 PMWJ
9 KMKR => 1 CZCB
21 TFGJ, 3 RVXT => 5 HRZP
39 FDGDX, 24 TPDSB => 2 RCLB
4 HRZP => 2 GJNK
6 RZNJR => 2 HBSKF
101 ORE => 8 RVXT
1 RCLB => 8 QXBTX
1 RJBTL => 7 RBLT
2 CFPZ, 2 JXCXB, 4 TPQZ => 1 LWFQ
1 QGJL, 24 GJNK, 6 TWGNB, 1 SLTX, 18 JFRXJ, 6 MSNM, 6 FDGDX, 2 JXCXB => 5 WSNPZ
4 RZNJR => 6 FPQRV
12 LJDRB, 10 JFRXJ, 1 ZGXGP => 5 TXZVH
13 KSJD, 11 FXGW => 9 PRWD
11 SVFT, 2 HZDWS, 1 CLGXQ, 1 LQXCP, 6 JXCXB, 11 PRWD => 5 XTMRV
27 TWGNB, 7 FPQRV => 2 SLTX
2 HRZP, 6 RXWQR => 9 RJBTL
2 CXHK, 1 RPKZ => 1 RTFKN
7 RWSH, 12 JBVN, 6 FXGW => 2 ZGXGP
1 TXZVH, 4 FPQRV => 8 MSNM
16 TPDSB, 1 FXGW => 5 HPXST
1 VRVDQ => 2 FXGW
2019/day14/prompt.txt
-106
View File
@@ -1,106 +0,0 @@
--- Day 14: Space Stoichiometry ---
As you approach the rings of Saturn, your ship's low fuel indicator turns on. There isn't any fuel here, but the rings have plenty of raw material. Perhaps your ship's Inter-Stellar Refinery Union brand nanofactory can turn these raw materials into fuel.
You ask the nanofactory to produce a list of the reactions it can perform that are relevant to this process (your puzzle input). Every reaction turns some quantities of specific input chemicals into some quantity of an output chemical. Almost every chemical is produced by exactly one reaction; the only exception, ORE, is the raw material input to the entire process and is not produced by a reaction.
You just need to know how much ORE you'll need to collect before you can produce one unit of FUEL.
Each reaction gives specific quantities for its inputs and output; reactions cannot be partially run, so only whole integer multiples of these quantities can be used. (It's okay to have leftover chemicals when you're done, though.) For example, the reaction 1 A, 2 B, 3 C => 2 D means that exactly 2 units of chemical D can be produced by consuming exactly 1 A, 2 B and 3 C. You can run the full reaction as many times as necessary; for example, you could produce 10 D by consuming 5 A, 10 B, and 15 C.
Suppose your nanofactory produces the following list of reactions:
10 ORE => 10 A
1 ORE => 1 B
7 A, 1 B => 1 C
7 A, 1 C => 1 D
7 A, 1 D => 1 E
7 A, 1 E => 1 FUEL
The first two reactions use only ORE as inputs; they indicate that you can produce as much of chemical A as you want (in increments of 10 units, each 10 costing 10 ORE) and as much of chemical B as you want (each costing 1 ORE). To produce 1 FUEL, a total of 31 ORE is required: 1 ORE to produce 1 B, then 30 more ORE to produce the 7 + 7 + 7 + 7 = 28 A (with 2 extra A wasted) required in the reactions to convert the B into C, C into D, D into E, and finally E into FUEL. (30 A is produced because its reaction requires that it is created in increments of 10.)
Or, suppose you have the following list of reactions:
9 ORE => 2 A
8 ORE => 3 B
7 ORE => 5 C
3 A, 4 B => 1 AB
5 B, 7 C => 1 BC
4 C, 1 A => 1 CA
2 AB, 3 BC, 4 CA => 1 FUEL
The above list of reactions requires 165 ORE to produce 1 FUEL:
Consume 45 ORE to produce 10 A.
Consume 64 ORE to produce 24 B.
Consume 56 ORE to produce 40 C.
Consume 6 A, 8 B to produce 2 AB.
Consume 15 B, 21 C to produce 3 BC.
Consume 16 C, 4 A to produce 4 CA.
Consume 2 AB, 3 BC, 4 CA to produce 1 FUEL.
Here are some larger examples:
13312 ORE for 1 FUEL:
157 ORE => 5 NZVS
165 ORE => 6 DCFZ
44 XJWVT, 5 KHKGT, 1 QDVJ, 29 NZVS, 9 GPVTF, 48 HKGWZ => 1 FUEL
12 HKGWZ, 1 GPVTF, 8 PSHF => 9 QDVJ
179 ORE => 7 PSHF
177 ORE => 5 HKGWZ
7 DCFZ, 7 PSHF => 2 XJWVT
165 ORE => 2 GPVTF
3 DCFZ, 7 NZVS, 5 HKGWZ, 10 PSHF => 8 KHKGT
180697 ORE for 1 FUEL:
2 VPVL, 7 FWMGM, 2 CXFTF, 11 MNCFX => 1 STKFG
17 NVRVD, 3 JNWZP => 8 VPVL
53 STKFG, 6 MNCFX, 46 VJHF, 81 HVMC, 68 CXFTF, 25 GNMV => 1 FUEL
22 VJHF, 37 MNCFX => 5 FWMGM
139 ORE => 4 NVRVD
144 ORE => 7 JNWZP
5 MNCFX, 7 RFSQX, 2 FWMGM, 2 VPVL, 19 CXFTF => 3 HVMC
5 VJHF, 7 MNCFX, 9 VPVL, 37 CXFTF => 6 GNMV
145 ORE => 6 MNCFX
1 NVRVD => 8 CXFTF
1 VJHF, 6 MNCFX => 4 RFSQX
176 ORE => 6 VJHF
2210736 ORE for 1 FUEL:
171 ORE => 8 CNZTR
7 ZLQW, 3 BMBT, 9 XCVML, 26 XMNCP, 1 WPTQ, 2 MZWV, 1 RJRHP => 4 PLWSL
114 ORE => 4 BHXH
14 VRPVC => 6 BMBT
6 BHXH, 18 KTJDG, 12 WPTQ, 7 PLWSL, 31 FHTLT, 37 ZDVW => 1 FUEL
6 WPTQ, 2 BMBT, 8 ZLQW, 18 KTJDG, 1 XMNCP, 6 MZWV, 1 RJRHP => 6 FHTLT
15 XDBXC, 2 LTCX, 1 VRPVC => 6 ZLQW
13 WPTQ, 10 LTCX, 3 RJRHP, 14 XMNCP, 2 MZWV, 1 ZLQW => 1 ZDVW
5 BMBT => 4 WPTQ
189 ORE => 9 KTJDG
1 MZWV, 17 XDBXC, 3 XCVML => 2 XMNCP
12 VRPVC, 27 CNZTR => 2 XDBXC
15 KTJDG, 12 BHXH => 5 XCVML
3 BHXH, 2 VRPVC => 7 MZWV
121 ORE => 7 VRPVC
7 XCVML => 6 RJRHP
5 BHXH, 4 VRPVC => 5 LTCX
Given the list of reactions in your puzzle input, what is the minimum amount of ORE required to produce exactly 1 FUEL?
Your puzzle answer was 1185296.
--- Part Two ---
After collecting ORE for a while, you check your cargo hold: 1 trillion (1000000000000) units of ORE.
With that much ore, given the examples above:
The 13312 ORE-per-FUEL example could produce 82892753 FUEL.
The 180697 ORE-per-FUEL example could produce 5586022 FUEL.
The 2210736 ORE-per-FUEL example could produce 460664 FUEL.
Given 1 trillion ORE, what is the maximum amount of FUEL you can produce?
Your puzzle answer was 1376631.
Both parts of this puzzle are complete! They provide two gold stars: **
At this point, you should return to your Advent calendar and try another puzzle.
If you still want to see it, you can get your puzzle input.
You can also [Share] this puzzle.
2019/day15/input.txt
-1
View File
@@ -1 +0,0 @@
3,1033,1008,1033,1,1032,1005,1032,31,1008,1033,2,1032,1005,1032,58,1008,1033,3,1032,1005,1032,81,1008,1033,4,1032,1005,1032,104,99,1002,1034,1,1039,1001,1036,0,1041,1001,1035,-1,1040,1008,1038,0,1043,102,-1,1043,1032,1,1037,1032,1042,1105,1,124,1001,1034,0,1039,102,1,1036,1041,1001,1035,1,1040,1008,1038,0,1043,1,1037,1038,1042,1105,1,124,1001,1034,-1,1039,1008,1036,0,1041,101,0,1035,1040,102,1,1038,1043,1001,1037,0,1042,1106,0,124,1001,1034,1,1039,1008,1036,0,1041,1001,1035,0,1040,102,1,1038,1043,1001,1037,0,1042,1006,1039,217,1006,1040,217,1008,1039,40,1032,1005,1032,217,1008,1040,40,1032,1005,1032,217,1008,1039,9,1032,1006,1032,165,1008,1040,5,1032,1006,1032,165,1101,0,2,1044,1105,1,224,2,1041,1043,1032,1006,1032,179,1102,1,1,1044,1106,0,224,1,1041,1043,1032,1006,1032,217,1,1042,1043,1032,1001,1032,-1,1032,1002,1032,39,1032,1,1032,1039,1032,101,-1,1032,1032,101,252,1032,211,1007,0,40,1044,1106,0,224,1101,0,0,1044,1106,0,224,1006,1044,247,102,1,1039,1034,101,0,1040,1035,101,0,1041,1036,1001,1043,0,1038,1001,1042,0,1037,4,1044,1106,0,0,26,29,83,66,1,36,14,44,33,12,3,15,20,56,9,35,51,55,6,20,13,71,15,23,94,38,45,15,47,30,89,39,11,55,5,9,47,29,41,36,78,12,4,65,48,66,36,94,76,30,63,41,32,1,73,1,35,65,87,46,18,90,11,44,30,73,87,8,38,46,17,78,51,34,19,53,37,26,20,24,46,64,17,6,26,41,10,62,14,88,23,94,13,55,5,45,10,39,83,99,32,34,72,30,58,33,71,47,21,38,97,38,46,41,18,39,37,8,86,55,35,4,92,19,21,53,61,6,55,69,16,85,62,26,63,17,80,33,10,53,91,2,37,94,37,93,7,97,18,55,54,36,17,62,89,12,92,32,69,4,46,47,19,89,25,12,51,91,9,1,71,35,56,39,98,48,7,49,24,95,15,45,2,1,93,82,19,7,11,70,30,64,28,27,58,4,39,30,94,72,33,43,90,98,26,32,70,1,81,25,35,47,17,31,92,15,73,13,27,72,65,30,67,2,22,89,77,30,47,12,58,26,79,22,37,74,41,3,42,30,39,67,24,18,62,98,19,59,95,25,6,67,42,35,85,51,48,7,63,17,67,53,45,13,25,43,1,54,4,65,55,20,73,32,70,1,33,39,93,88,19,35,56,21,13,53,73,31,21,44,73,31,13,69,30,42,26,51,25,90,16,49,9,93,50,28,60,24,18,61,23,11,98,19,45,77,12,61,31,3,66,56,4,77,24,59,87,31,38,65,67,7,9,23,71,9,59,35,55,83,22,12,94,17,67,87,96,63,8,29,32,34,15,55,39,60,41,74,39,81,47,51,25,26,57,28,18,60,84,20,16,66,42,14,25,16,94,2,22,74,85,19,63,32,9,19,11,91,44,34,21,1,56,12,87,8,52,18,56,7,90,5,86,81,24,98,21,9,80,59,68,10,80,53,18,75,50,9,14,43,26,29,57,86,39,41,93,3,69,55,16,84,15,22,84,30,72,19,13,15,19,80,97,79,32,68,77,82,30,19,4,71,45,67,14,95,17,54,80,88,25,13,80,41,37,96,15,28,26,33,73,32,45,79,21,52,23,98,82,21,16,13,64,32,39,93,17,33,95,61,36,12,21,3,84,4,88,22,26,59,80,27,82,2,85,79,29,33,52,17,23,95,8,64,16,56,23,42,43,18,41,11,9,84,42,62,4,67,17,98,76,99,1,16,72,72,10,79,19,76,4,54,9,99,34,33,7,97,85,19,76,93,38,6,90,37,90,2,83,61,19,43,39,2,91,17,60,21,79,2,32,94,38,32,7,64,8,14,7,68,23,28,75,24,73,50,29,63,22,89,4,51,66,2,7,33,82,13,23,84,81,23,55,68,15,27,9,97,27,79,42,86,75,56,13,95,74,5,88,25,44,99,33,14,24,29,21,78,4,15,75,32,92,74,11,56,24,57,10,28,73,8,10,90,77,30,96,8,60,3,71,20,41,9,33,89,38,74,95,4,95,35,13,18,55,10,81,9,60,17,67,7,34,48,48,15,54,79,37,66,43,22,64,28,28,4,91,5,9,92,30,64,37,98,66,15,92,2,3,25,70,25,33,61,56,25,70,58,30,41,97,18,54,10,49,45,3,1,30,57,30,46,8,55,79,39,58,46,35,19,38,80,86,4,36,75,29,62,39,71,2,41,6,66,36,99,21,61,39,72,3,48,29,43,31,59,84,71,12,52,61,82,11,56,23,51,30,60,88,65,35,48,24,58,76,49,93,51,33,72,0,0,21,21,1,10,1,0,0,0,0,0,0
2019/day15/prompt.txt
-118
View File
@@ -1,118 +0,0 @@
--- Day 15: Oxygen System ---
Out here in deep space, many things can go wrong. Fortunately, many of those things have indicator lights. Unfortunately, one of those lights is lit: the oxygen system for part of the ship has failed!
According to the readouts, the oxygen system must have failed days ago after a rupture in oxygen tank two; that section of the ship was automatically sealed once oxygen levels went dangerously low. A single remotely-operated repair droid is your only option for fixing the oxygen system.
The Elves' care package included an Intcode program (your puzzle input) that you can use to remotely control the repair droid. By running that program, you can direct the repair droid to the oxygen system and fix the problem.
The remote control program executes the following steps in a loop forever:
Accept a movement command via an input instruction.
Send the movement command to the repair droid.
Wait for the repair droid to finish the movement operation.
Report on the status of the repair droid via an output instruction.
Only four movement commands are understood: north (1), south (2), west (3), and east (4). Any other command is invalid. The movements differ in direction, but not in distance: in a long enough east-west hallway, a series of commands like 4,4,4,4,3,3,3,3 would leave the repair droid back where it started.
The repair droid can reply with any of the following status codes:
0: The repair droid hit a wall. Its position has not changed.
1: The repair droid has moved one step in the requested direction.
2: The repair droid has moved one step in the requested direction; its new position is the location of the oxygen system.
You don't know anything about the area around the repair droid, but you can figure it out by watching the status codes.
For example, we can draw the area using D for the droid, # for walls, . for locations the droid can traverse, and empty space for unexplored locations. Then, the initial state looks like this:
D
To make the droid go north, send it 1. If it replies with 0, you know that location is a wall and that the droid didn't move:
#
D
To move east, send 4; a reply of 1 means the movement was successful:
#
.D
Then, perhaps attempts to move north (1), south (2), and east (4) are all met with replies of 0:
##
.D#
#
Now, you know the repair droid is in a dead end. Backtrack with 3 (which you already know will get a reply of 1 because you already know that location is open):
##
D.#
#
Then, perhaps west (3) gets a reply of 0, south (2) gets a reply of 1, south again (2) gets a reply of 0, and then west (3) gets a reply of 2:
##
#..#
D.#
#
Now, because of the reply of 2, you know you've found the oxygen system! In this example, it was only 2 moves away from the repair droid's starting position.
What is the fewest number of movement commands required to move the repair droid from its starting position to the location of the oxygen system?
Your puzzle answer was 280.
--- Part Two ---
You quickly repair the oxygen system; oxygen gradually fills the area.
Oxygen starts in the location containing the repaired oxygen system. It takes one minute for oxygen to spread to all open locations that are adjacent to a location that already contains oxygen. Diagonal locations are not adjacent.
In the example above, suppose you've used the droid to explore the area fully and have the following map (where locations that currently contain oxygen are marked O):
##
#..##
#.#..#
#.O.#
###
Initially, the only location which contains oxygen is the location of the repaired oxygen system. However, after one minute, the oxygen spreads to all open (.) locations that are adjacent to a location containing oxygen:
##
#..##
#.#..#
#OOO#
###
After a total of two minutes, the map looks like this:
##
#..##
#O#O.#
#OOO#
###
After a total of three minutes:
##
#O.##
#O#OO#
#OOO#
###
And finally, the whole region is full of oxygen after a total of four minutes:
##
#OO##
#O#OO#
#OOO#
###
So, in this example, all locations contain oxygen after 4 minutes.
Use the repair droid to get a complete map of the area. How many minutes will it take to fill with oxygen?
Your puzzle answer was 400.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day16/input.txt
-1
View File
@@ -1 +0,0 @@
59766977873078199970107568349014384917072096886862753001181795467415574411535593439580118271423936468093569795214812464528265609129756216554981001419093454383882560114421882354033176205096303121974045739484366182044891267778931831792562035297585485658843180220796069147506364472390622739583789825303426921751073753670825259141712329027078263584903642919122991531729298497467435911779410970734568708255590755424253797639255236759229935298472380039602200033415155467240682533288468148414065641667678718893872482168857631352275667414965503393341925955626006552556064728352731985387163635634298416016700583512112158756656289482437803808487304460165855189
2019/day16/prompt.txt
-88
View File
@@ -1,88 +0,0 @@
--- Day 16: Flawed Frequency Transmission ---
You're 3/4ths of the way through the gas giants. Not only do roundtrip signals to Earth take five hours, but the signal quality is quite bad as well. You can clean up the signal with the Flawed Frequency Transmission algorithm, or FFT.
As input, FFT takes a list of numbers. In the signal you received (your puzzle input), each number is a single digit: data like 15243 represents the sequence 1, 5, 2, 4, 3.
FFT operates in repeated phases. In each phase, a new list is constructed with the same length as the input list. This new list is also used as the input for the next phase.
Each element in the new list is built by multiplying every value in the input list by a value in a repeating pattern and then adding up the results. So, if the input list were 9, 8, 7, 6, 5 and the pattern for a given element were 1, 2, 3, the result would be 9*1 + 8*2 + 7*3 + 6*1 + 5*2 (with each input element on the left and each value in the repeating pattern on the right of each multiplication). Then, only the ones digit is kept: 38 becomes 8, -17 becomes 7, and so on.
While each element in the output array uses all of the same input array elements, the actual repeating pattern to use depends on which output element is being calculated. The base pattern is 0, 1, 0, -1. Then, repeat each value in the pattern a number of times equal to the position in the output list being considered. Repeat once for the first element, twice for the second element, three times for the third element, and so on. So, if the third element of the output list is being calculated, repeating the values would produce: 0, 0, 0, 1, 1, 1, 0, 0, 0, -1, -1, -1.
When applying the pattern, skip the very first value exactly once. (In other words, offset the whole pattern left by one.) So, for the second element of the output list, the actual pattern used would be: 0, 1, 1, 0, 0, -1, -1, 0, 0, 1, 1, 0, 0, -1, -1, ....
After using this process to calculate each element of the output list, the phase is complete, and the output list of this phase is used as the new input list for the next phase, if any.
Given the input signal 12345678, below are four phases of FFT. Within each phase, each output digit is calculated on a single line with the result at the far right; each multiplication operation shows the input digit on the left and the pattern value on the right:
Input signal: 12345678
1*1 + 2*0 + 3*-1 + 4*0 + 5*1 + 6*0 + 7*-1 + 8*0 = 4
1*0 + 2*1 + 3*1 + 4*0 + 5*0 + 6*-1 + 7*-1 + 8*0 = 8
1*0 + 2*0 + 3*1 + 4*1 + 5*1 + 6*0 + 7*0 + 8*0 = 2
1*0 + 2*0 + 3*0 + 4*1 + 5*1 + 6*1 + 7*1 + 8*0 = 2
1*0 + 2*0 + 3*0 + 4*0 + 5*1 + 6*1 + 7*1 + 8*1 = 6
1*0 + 2*0 + 3*0 + 4*0 + 5*0 + 6*1 + 7*1 + 8*1 = 1
1*0 + 2*0 + 3*0 + 4*0 + 5*0 + 6*0 + 7*1 + 8*1 = 5
1*0 + 2*0 + 3*0 + 4*0 + 5*0 + 6*0 + 7*0 + 8*1 = 8
After 1 phase: 48226158
4*1 + 8*0 + 2*-1 + 2*0 + 6*1 + 1*0 + 5*-1 + 8*0 = 3
4*0 + 8*1 + 2*1 + 2*0 + 6*0 + 1*-1 + 5*-1 + 8*0 = 4
4*0 + 8*0 + 2*1 + 2*1 + 6*1 + 1*0 + 5*0 + 8*0 = 0
4*0 + 8*0 + 2*0 + 2*1 + 6*1 + 1*1 + 5*1 + 8*0 = 4
4*0 + 8*0 + 2*0 + 2*0 + 6*1 + 1*1 + 5*1 + 8*1 = 0
4*0 + 8*0 + 2*0 + 2*0 + 6*0 + 1*1 + 5*1 + 8*1 = 4
4*0 + 8*0 + 2*0 + 2*0 + 6*0 + 1*0 + 5*1 + 8*1 = 3
4*0 + 8*0 + 2*0 + 2*0 + 6*0 + 1*0 + 5*0 + 8*1 = 8
After 2 phases: 34040438
3*1 + 4*0 + 0*-1 + 4*0 + 0*1 + 4*0 + 3*-1 + 8*0 = 0
3*0 + 4*1 + 0*1 + 4*0 + 0*0 + 4*-1 + 3*-1 + 8*0 = 3
3*0 + 4*0 + 0*1 + 4*1 + 0*1 + 4*0 + 3*0 + 8*0 = 4
3*0 + 4*0 + 0*0 + 4*1 + 0*1 + 4*1 + 3*1 + 8*0 = 1
3*0 + 4*0 + 0*0 + 4*0 + 0*1 + 4*1 + 3*1 + 8*1 = 5
3*0 + 4*0 + 0*0 + 4*0 + 0*0 + 4*1 + 3*1 + 8*1 = 5
3*0 + 4*0 + 0*0 + 4*0 + 0*0 + 4*0 + 3*1 + 8*1 = 1
3*0 + 4*0 + 0*0 + 4*0 + 0*0 + 4*0 + 3*0 + 8*1 = 8
After 3 phases: 03415518
0*1 + 3*0 + 4*-1 + 1*0 + 5*1 + 5*0 + 1*-1 + 8*0 = 0
0*0 + 3*1 + 4*1 + 1*0 + 5*0 + 5*-1 + 1*-1 + 8*0 = 1
0*0 + 3*0 + 4*1 + 1*1 + 5*1 + 5*0 + 1*0 + 8*0 = 0
0*0 + 3*0 + 4*0 + 1*1 + 5*1 + 5*1 + 1*1 + 8*0 = 2
0*0 + 3*0 + 4*0 + 1*0 + 5*1 + 5*1 + 1*1 + 8*1 = 9
0*0 + 3*0 + 4*0 + 1*0 + 5*0 + 5*1 + 1*1 + 8*1 = 4
0*0 + 3*0 + 4*0 + 1*0 + 5*0 + 5*0 + 1*1 + 8*1 = 9
0*0 + 3*0 + 4*0 + 1*0 + 5*0 + 5*0 + 1*0 + 8*1 = 8
After 4 phases: 01029498
Here are the first eight digits of the final output list after 100 phases for some larger inputs:
80871224585914546619083218645595 becomes 24176176.
19617804207202209144916044189917 becomes 73745418.
69317163492948606335995924319873 becomes 52432133.
After 100 phases of FFT, what are the first eight digits in the final output list?
Your puzzle answer was 27831665.
--- Part Two ---
Now that your FFT is working, you can decode the real signal.
The real signal is your puzzle input repeated 10000 times. Treat this new signal as a single input list. Patterns are still calculated as before, and 100 phases of FFT are still applied.
The first seven digits of your initial input signal also represent the message offset. The message offset is the location of the eight-digit message in the final output list. Specifically, the message offset indicates the number of digits to skip before reading the eight-digit message. For example, if the first seven digits of your initial input signal were 1234567, the eight-digit message would be the eight digits after skipping 1,234,567 digits of the final output list. Or, if the message offset were 7 and your final output list were 98765432109876543210, the eight-digit message would be 21098765. (Of course, your real message offset will be a seven-digit number, not a one-digit number like 7.)
Here is the eight-digit message in the final output list after 100 phases. The message offset given in each input has been highlighted. (Note that the inputs given below are repeated 10000 times to find the actual starting input lists.)
03036732577212944063491565474664 becomes 84462026.
02935109699940807407585447034323 becomes 78725270.
03081770884921959731165446850517 becomes 53553731.
After repeating your input signal 10000 times and running 100 phases of FFT, what is the eight-digit message embedded in the final output list?
Your puzzle answer was 36265589.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day17/input.txt
-1
View File
@@ -1 +0,0 @@
1,330,331,332,109,3406,1102,1182,1,15,1101,0,1481,24,1002,0,1,570,1006,570,36,1002,571,1,0,1001,570,-1,570,1001,24,1,24,1106,0,18,1008,571,0,571,1001,15,1,15,1008,15,1481,570,1006,570,14,21101,0,58,0,1105,1,786,1006,332,62,99,21101,0,333,1,21102,1,73,0,1106,0,579,1101,0,0,572,1101,0,0,573,3,574,101,1,573,573,1007,574,65,570,1005,570,151,107,67,574,570,1005,570,151,1001,574,-64,574,1002,574,-1,574,1001,572,1,572,1007,572,11,570,1006,570,165,101,1182,572,127,1001,574,0,0,3,574,101,1,573,573,1008,574,10,570,1005,570,189,1008,574,44,570,1006,570,158,1105,1,81,21101,340,0,1,1105,1,177,21101,477,0,1,1106,0,177,21102,514,1,1,21102,1,176,0,1106,0,579,99,21102,184,1,0,1105,1,579,4,574,104,10,99,1007,573,22,570,1006,570,165,1002,572,1,1182,21101,0,375,1,21101,0,211,0,1106,0,579,21101,1182,11,1,21102,222,1,0,1105,1,979,21102,388,1,1,21102,1,233,0,1106,0,579,21101,1182,22,1,21101,244,0,0,1105,1,979,21102,401,1,1,21102,1,255,0,1105,1,579,21101,1182,33,1,21101,0,266,0,1106,0,979,21101,414,0,1,21102,277,1,0,1106,0,579,3,575,1008,575,89,570,1008,575,121,575,1,575,570,575,3,574,1008,574,10,570,1006,570,291,104,10,21101,0,1182,1,21101,0,313,0,1106,0,622,1005,575,327,1101,0,1,575,21101,0,327,0,1105,1,786,4,438,99,0,1,1,6,77,97,105,110,58,10,33,10,69,120,112,101,99,116,101,100,32,102,117,110,99,116,105,111,110,32,110,97,109,101,32,98,117,116,32,103,111,116,58,32,0,12,70,117,110,99,116,105,111,110,32,65,58,10,12,70,117,110,99,116,105,111,110,32,66,58,10,12,70,117,110,99,116,105,111,110,32,67,58,10,23,67,111,110,116,105,110,117,111,117,115,32,118,105,100,101,111,32,102,101,101,100,63,10,0,37,10,69,120,112,101,99,116,101,100,32,82,44,32,76,44,32,111,114,32,100,105,115,116,97,110,99,101,32,98,117,116,32,103,111,116,58,32,36,10,69,120,112,101,99,116,101,100,32,99,111,109,109,97,32,111,114,32,110,101,119,108,105,110,101,32,98,117,116,32,103,111,116,58,32,43,10,68,101,102,105,110,105,116,105,111,110,115,32,109,97,121,32,98,101,32,97,116,32,109,111,115,116,32,50,48,32,99,104,97,114,97,99,116,101,114,115,33,10,94,62,118,60,0,1,0,-1,-1,0,1,0,0,0,0,0,0,1,26,16,0,109,4,2102,1,-3,587,20102,1,0,-1,22101,1,-3,-3,21102,0,1,-2,2208,-2,-1,570,1005,570,617,2201,-3,-2,609,4,0,21201,-2,1,-2,1105,1,597,109,-4,2105,1,0,109,5,2102,1,-4,629,21001,0,0,-2,22101,1,-4,-4,21102,1,0,-3,2208,-3,-2,570,1005,570,781,2201,-4,-3,653,20102,1,0,-1,1208,-1,-4,570,1005,570,709,1208,-1,-5,570,1005,570,734,1207,-1,0,570,1005,570,759,1206,-1,774,1001,578,562,684,1,0,576,576,1001,578,566,692,1,0,577,577,21102,1,702,0,1105,1,786,21201,-1,-1,-1,1106,0,676,1001,578,1,578,1008,578,4,570,1006,570,724,1001,578,-4,578,21102,731,1,0,1106,0,786,1105,1,774,1001,578,-1,578,1008,578,-1,570,1006,570,749,1001,578,4,578,21101,0,756,0,1105,1,786,1105,1,774,21202,-1,-11,1,22101,1182,1,1,21101,774,0,0,1106,0,622,21201,-3,1,-3,1106,0,640,109,-5,2106,0,0,109,7,1005,575,802,20102,1,576,-6,21002,577,1,-5,1105,1,814,21102,0,1,-1,21102,1,0,-5,21102,1,0,-6,20208,-6,576,-2,208,-5,577,570,22002,570,-2,-2,21202,-5,55,-3,22201,-6,-3,-3,22101,1481,-3,-3,2102,1,-3,843,1005,0,863,21202,-2,42,-4,22101,46,-4,-4,1206,-2,924,21101,0,1,-1,1106,0,924,1205,-2,873,21101,0,35,-4,1105,1,924,1202,-3,1,878,1008,0,1,570,1006,570,916,1001,374,1,374,2102,1,-3,895,1102,1,2,0,2101,0,-3,902,1001,438,0,438,2202,-6,-5,570,1,570,374,570,1,570,438,438,1001,578,558,921,21002,0,1,-4,1006,575,959,204,-4,22101,1,-6,-6,1208,-6,55,570,1006,570,814,104,10,22101,1,-5,-5,1208,-5,35,570,1006,570,810,104,10,1206,-1,974,99,1206,-1,974,1102,1,1,575,21101,973,0,0,1106,0,786,99,109,-7,2105,1,0,109,6,21102,0,1,-4,21102,1,0,-3,203,-2,22101,1,-3,-3,21208,-2,82,-1,1205,-1,1030,21208,-2,76,-1,1205,-1,1037,21207,-2,48,-1,1205,-1,1124,22107,57,-2,-1,1205,-1,1124,21201,-2,-48,-2,1106,0,1041,21101,-4,0,-2,1105,1,1041,21101,0,-5,-2,21201,-4,1,-4,21207,-4,11,-1,1206,-1,1138,2201,-5,-4,1059,1201,-2,0,0,203,-2,22101,1,-3,-3,21207,-2,48,-1,1205,-1,1107,22107,57,-2,-1,1205,-1,1107,21201,-2,-48,-2,2201,-5,-4,1090,20102,10,0,-1,22201,-2,-1,-2,2201,-5,-4,1103,2102,1,-2,0,1105,1,1060,21208,-2,10,-1,1205,-1,1162,21208,-2,44,-1,1206,-1,1131,1105,1,989,21102,1,439,1,1105,1,1150,21101,0,477,1,1106,0,1150,21102,514,1,1,21102,1,1149,0,1105,1,579,99,21102,1,1157,0,1106,0,579,204,-2,104,10,99,21207,-3,22,-1,1206,-1,1138,2101,0,-5,1176,2101,0,-4,0,109,-6,2106,0,0,40,13,42,1,11,1,10,7,25,1,11,1,10,1,5,1,25,1,11,1,10,1,5,1,1,13,11,1,11,1,10,1,5,1,1,1,11,1,11,1,11,1,10,1,5,1,1,1,11,1,11,1,11,1,10,1,5,1,1,1,11,1,11,1,11,1,10,13,7,1,11,1,11,1,16,1,1,1,3,1,7,1,11,1,11,1,16,1,1,1,1,11,5,7,11,1,16,1,1,1,1,1,1,1,13,1,17,1,16,11,9,1,7,11,18,1,1,1,1,1,3,1,9,1,7,1,28,1,1,1,1,1,3,1,9,1,7,1,28,1,1,1,1,1,3,1,9,1,7,1,28,11,7,1,7,1,30,1,1,1,3,1,9,1,7,1,22,11,3,1,9,1,7,1,22,1,7,1,5,1,9,1,7,1,22,1,7,11,5,1,7,1,22,1,13,1,3,1,5,1,7,1,18,11,7,11,7,13,6,1,3,1,5,1,11,1,25,1,6,1,3,1,5,1,11,1,25,1,6,1,3,1,5,1,11,1,25,1,6,1,3,1,5,1,11,1,25,1,6,1,3,1,5,1,11,1,25,12,5,1,11,1,25,2,5,1,9,1,11,1,26,1,5,1,9,1,11,1,26,1,5,1,9,1,11,1,26,1,5,1,9,13,26,1,5,1,48,7,48
2019/day17/prompt.txt
-119
View File
@@ -1,119 +0,0 @@
--- Day 17: Set and Forget ---
An early warning system detects an incoming solar flare and automatically activates the ship's electromagnetic shield. Unfortunately, this has cut off the Wi-Fi for many small robots that, unaware of the impending danger, are now trapped on exterior scaffolding on the unsafe side of the shield. To rescue them, you'll have to act quickly!
The only tools at your disposal are some wired cameras and a small vacuum robot currently asleep at its charging station. The video quality is poor, but the vacuum robot has a needlessly bright LED that makes it easy to spot no matter where it is.
An Intcode program, the Aft Scaffolding Control and Information Interface (ASCII, your puzzle input), provides access to the cameras and the vacuum robot. Currently, because the vacuum robot is asleep, you can only access the cameras.
Running the ASCII program on your Intcode computer will provide the current view of the scaffolds. This is output, purely coincidentally, as ASCII code: 35 means #, 46 means ., 10 starts a new line of output below the current one, and so on. (Within a line, characters are drawn left-to-right.)
In the camera output, # represents a scaffold and . represents open space. The vacuum robot is visible as ^, v, <, or > depending on whether it is facing up, down, left, or right respectively. When drawn like this, the vacuum robot is always on a scaffold; if the vacuum robot ever walks off of a scaffold and begins tumbling through space uncontrollably, it will instead be visible as X.
In general, the scaffold forms a path, but it sometimes loops back onto itself. For example, suppose you can see the following view from the cameras:
..#..........
..#..........
#######...###
#.#...#...#.#
#############
..#...#...#..
..#####...^..
Here, the vacuum robot, ^ is facing up and sitting at one end of the scaffold near the bottom-right of the image. The scaffold continues up, loops across itself several times, and ends at the top-left of the image.
The first step is to calibrate the cameras by getting the alignment parameters of some well-defined points. Locate all scaffold intersections; for each, its alignment parameter is the distance between its left edge and the left edge of the view multiplied by the distance between its top edge and the top edge of the view. Here, the intersections from the above image are marked O:
..#..........
..#..........
##O####...###
#.#...#...#.#
##O###O###O##
..#...#...#..
..#####...^..
For these intersections:
The top-left intersection is 2 units from the left of the image and 2 units from the top of the image, so its alignment parameter is 2 * 2 = 4.
The bottom-left intersection is 2 units from the left and 4 units from the top, so its alignment parameter is 2 * 4 = 8.
The bottom-middle intersection is 6 from the left and 4 from the top, so its alignment parameter is 24.
The bottom-right intersection's alignment parameter is 40.
To calibrate the cameras, you need the sum of the alignment parameters. In the above example, this is 76.
Run your ASCII program. What is the sum of the alignment parameters for the scaffold intersections?
Your puzzle answer was 3888.
--- Part Two ---
Now for the tricky part: notifying all the other robots about the solar flare. The vacuum robot can do this automatically if it gets into range of a robot. However, you can't see the other robots on the camera, so you need to be thorough instead: you need to make the vacuum robot visit every part of the scaffold at least once.
The vacuum robot normally wanders randomly, but there isn't time for that today. Instead, you can override its movement logic with new rules.
Force the vacuum robot to wake up by changing the value in your ASCII program at address 0 from 1 to 2. When you do this, you will be automatically prompted for the new movement rules that the vacuum robot should use. The ASCII program will use input instructions to receive them, but they need to be provided as ASCII code; end each line of logic with a single newline, ASCII code 10.
First, you will be prompted for the main movement routine. The main routine may only call the movement functions: A, B, or C. Supply the movement functions to use as ASCII text, separating them with commas (,, ASCII code 44), and ending the list with a newline (ASCII code 10). For example, to call A twice, then alternate between B and C three times, provide the string A,A,B,C,B,C,B,C and then a newline.
Then, you will be prompted for each movement function. Movement functions may use L to turn left, R to turn right, or a number to move forward that many units. Movement functions may not call other movement functions. Again, separate the actions with commas and end the list with a newline. For example, to move forward 10 units, turn left, move forward 8 units, turn right, and finally move forward 6 units, provide the string 10,L,8,R,6 and then a newline.
Finally, you will be asked whether you want to see a continuous video feed; provide either y or n and a newline. Enabling the continuous video feed can help you see what's going on, but it also requires a significant amount of processing power, and may even cause your Intcode computer to overheat.
Due to the limited amount of memory in the vacuum robot, the ASCII definitions of the main routine and the movement functions may each contain at most 20 characters, not counting the newline.
For example, consider the following camera feed:
#######...#####
#.....#...#...#
#.....#...#...#
......#...#...#
......#...###.#
......#.....#.#
^########...#.#
......#.#...#.#
......#########
........#...#..
....#########..
....#...#......
....#...#......
....#...#......
....#####......
In order for the vacuum robot to visit every part of the scaffold at least once, one path it could take is:
R,8,R,8,R,4,R,4,R,8,L,6,L,2,R,4,R,4,R,8,R,8,R,8,L,6,L,2
Without the memory limit, you could just supply this whole string to function A and have the main routine call A once. However, you'll need to split it into smaller parts.
One approach is:
Main routine: A,B,C,B,A,C
(ASCII input: 65, 44, 66, 44, 67, 44, 66, 44, 65, 44, 67, 10)
Function A: R,8,R,8
(ASCII input: 82, 44, 56, 44, 82, 44, 56, 10)
Function B: R,4,R,4,R,8
(ASCII input: 82, 44, 52, 44, 82, 44, 52, 44, 82, 44, 56, 10)
Function C: L,6,L,2
(ASCII input: 76, 44, 54, 44, 76, 44, 50, 10)
Visually, this would break the desired path into the following parts:
A, B, C, B, A, C
R,8,R,8, R,4,R,4,R,8, L,6,L,2, R,4,R,4,R,8, R,8,R,8, L,6,L,2
CCCCCCA...BBBBB
C.....A...B...B
C.....A...B...B
......A...B...B
......A...CCC.B
......A.....C.B
^AAAAAAAA...C.B
......A.A...C.B
......AAAAAA#AB
........A...C..
....BBBB#BBBB..
....B...A......
....B...A......
....B...A......
....BBBBA......
Of course, the scaffolding outside your ship is much more complex.
As the vacuum robot finds other robots and notifies them of the impending solar flare, it also can't help but leave them squeaky clean, collecting any space dust it finds. Once it finishes the programmed set of movements, assuming it hasn't drifted off into space, the cleaning robot will return to its docking station and report the amount of space dust it collected as a large, non-ASCII value in a single output instruction.
After visiting every part of the scaffold at least once, how much dust does the vacuum robot report it has collected?
Your puzzle answer was 927809.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day18/input.txt
-81
View File
@@ -1,81 +0,0 @@
#################################################################################
#...........#.....#.#...........#.....#.#...#...#...........#...........#......u#
###.#######.#.###.#.#.###.#######.###.#.#.#.###.#.#######.###.#####.###.###.###.#
#...#.....#.#.#.#.#.....#.#.......#...#.#.#...#.#.#.....#.........#...#...#...#.#
#.#####I#.#.#.#.#.#######.#.#######.###.#.###.#.#.#####.#############.###.#####.#
#.....#.#.#.#.#...........#.....#.#.....#...#.#.#.......#.....#.....#...#...#...#
#.###.#.#.#.#.#################.#.#####.#.#.#.#J#######.#.#.#.#.###.###.###.#.#.#
#...#.#.#.....#.....#...........#.#.....#.#.#.#...#.....#.#.#.#.#.....#.#...Y.#.#
#####.#########.###.#.###########.#.#######.#.#.#.#.#####.#H#.#.#####.#.#######.#
#...#...#.......#...#...#...#.....#.....#...#...#.#...#.#.#.#.#...#...#.....#...#
#.#.###.#.#######.#####.#.#.#.###.#####.#.#######.###.#.#.#.#####.###.###.#.#####
#.#.....#.#..k#..z......#.#.#...#.....#.#.....#.....#.#...#.#...#...#...#.#.....#
#.#####.#.#.#.###########.#####.#.#####.#.###.#######.#.###.#.#.###.###.#######.#
#.....#l#.R.#.....#.......#.....#...#...#...#.....#...#.#...#.#.....#...........#
#.###.#.#######.#.###.#.###.#######.#.#####.#####.#.#####.###.###.#############.#
#.#.#.#...#...#.#...#.#...#.#.....#.#...#.#.#.#...#...#...#...#...#...#.....#...#
#.#.#.###.#.#.#####.#.###.#.#.#.###.###.#.#.#.#.#####.#.###.#.#####.#.#.###.#.###
#...#.#...#.#.......#...#...#.#d..#.#...#..q..#...#...#...#.#.#.....#...Z.#r#.#.#
###.#.###.#V###########.#####.###.#.#.###########O#.#####.#.###.###########.#.#.#
#...#...#.#........f..#.#.....#...#.#.#.#.......#.#.#.....#.........#.......#...#
#######.#############.#.#######.###.#.#.#.#####.#.#.#.###.#########.#.#########.#
#.......#...........#.#.......#...#...#.#...#.#.#.#...#.#...#...#...#...#.#..e..#
#.#######.###.#.#############.###.#####.###.#.#.#.#####.###.###.###.###.#.#.#####
#p........#.#.#.#.......#...#...#.....#.#...#.#.#.#.......#...#.F.#...#.#...#.K.#
#.#########.#.###.#.###.#.#.###.###.#.#.#.###.#.#.#N#####.###.###.#####.#####.#.#
#...#.......#.....#...#.#.#.....#...#...#.#.......#.#...#...#...#.....#.......#.#
###.#.###.###########.###.#######.#####.#.#########.#.#####.###.#####.#####.###.#
#.#.#...#...........#.#...#.....#...S.#.#.#...#.......#...#...#.....#.....#...#.#
#.#.###########.###.#.#.###.###.#####.#.#.#.#.#.#######.#.###.#####.#####.###.#.#
#...#.........#.#...#...#...#.#.......#.#...#...#...#...#...#..x..#.#...#...#.#.#
#.###.#######.#.#########.#.#.#########.#.#######.#.#.#####.###.###.#.#####.###.#
#.....#.....#.#.......#...#.#.#.......#.#.#.......#.#.#.......#.#...#.#...#...#.#
#########.###.#.###.###.###.#.#.#####.#.#.#######.#.#.#######.#.#.###.#.#.###.#.#
#.....#...#...#.#.#.#...#...#...#..t#...#...#.....#.#.....#.....#...#...#...#..v#
#.###.#.###.###.#.#.#.###.###.#####.#######.#.#####.#####.###.#####.#####.#######
#.#.....#...#.....#.....#.#...........#.#...#.#...#.#...#...#.#...#.....#.......#
#.#######.#######.#####.#.###########.#.#.###.#.###.#.#.###.###.#.#####.#####.#.#
#.......#.#.....#.#...#.#.......#.#...#.#.....#...#...#...#.....#.....#.#...#.#.#
#.#####.#.#X###.###.#.#########.#.#.###.#######.#.#######.###########.#.#.#P###.#
#.....#.....#.......#...........#...............#.........T....g....#.....#.....#
#######################################.@.#######################################
#..y#...#.................#...#...................#.....#.........#.....#...#...#
#.###.#.#.#########.#.#####E#.#####.#.#.#.###.#####.###.###.#.###.###.#.#.#.#.#.#
#.#...#...#...#.#.U.#.#.....#.#...#.#.#.#.#.#...#...#.#...#.#...#.#...#.#.#.#.#.#
#.#.#######.#.#.#.#####.#####.#.#.###.#.#.#.###.#.###.###.#####.#.#.###.#A#.#.#.#
#.#...#...C.#...#.........#..a#.#...#.#.#.....#...#.#...#.#.....#.#.#...#.#b..#.#
#.###.#.#######.###########.###.###.#.#.#####.#####.#.#.#.#.#####.#.#.###.#####.#
#.....#.#.......#.#...B...#.#...#.#...#.#.#...#...#...#.#.#.#...#...#...#.#.....#
#.#####.#.#######.#.#####.#.#.#.#.#####.#.#.###.#.#####.#.#.#.#.#######.#.#.#####
#.W.....#.#...#...#...#...#.#.#.#.....#.#.#.....#.......#.#...#.#.....#...#...#.#
#########.#.#.###.###.#.###.#.#.#.#.###.#.#############.#.###.#.###.#.#.#####.#.#
#.......#...#...#.#...#.#...#.#.#.#.....#.....#.......#.#...#.#...#.#.#.#...#...#
#####.#.#######.#.#.###.###.#.#.#.#######.#####.#.#####.###.#.###.###.#.#.#.###.#
#.....#.......#.#.#.#...#...#.#.#.....#.#.....#.#.........#.#.#.#...#...#.#c#...#
#.#########.###.#.#.###.#.#####.#####.#.#.###.#.###########.#.#.###.#.###.#.#####
#.#.....#...#...#.#...#...#.G.#.#...#.#.#...#...#...#...#...#...#.#.#...#.#.....#
#.#.#####.###.###.###.#####.#.#.#.#.#.#.###.#####.###.#.#.#####.#.#.#####.#####.#
#.#.....#...#.#.....#.#.....#...#.#.#.#.#.#...#.....#.#...#...#...#..w......#.#.#
#.#.###.###.#.###.###.###.#########.#.#.#.###.#.###.#.###.#.#.###.#########.#.#.#
#.#...#...#.#...#.#...#...#.........#.#.#...#.#.#.#.#.#...#.#...#.#...#...#...#.#
#.#######.#.###.#.#.###.#######.#####.#.#.#.#.#.#.#.#.#####.###.###.#.#.#.#####.#
#.......#.#.#...#.#...#.#.......#.....#.#.#.#.#...#.#...#...#.#.....#...#...#...#
#.#####.#.#.#.###.#####.###.#.###.#####.#.#.#.#####.###.#.###.#######.#####.#.#.#
#.#...#.#...#.#...#.....#...#.#...#.....#.#.#.....#...#...#...#.....#.....#.#.#.#
#.#.#.#.#####.#.#.#.#####.###.#.#####.#.#.#######.###.#####.###.###.#######.#.###
#.#.#...#.....#.#...#...#...#.#....s..#.#.....#...#.....#...#...#.........#.#...#
#.#.###.#.#####.#####.#.#.#.#.#########.#.###.#.###.###.#.###.#.#########.#.###.#
#.#..m#.#.....#...#...#...#.#.#.......#.#.#.#.#.#...#...#...#.#.#...#...#...#..i#
#.###.#######.#.#.#.#######.#.#####.#.#.#.#.#.#.#.###.#####.#.###.#.#.#######.#.#
#...#.........#.#.#.......#.#...#...#.#.#.#.#...#.#...#...#.#.....#.#.......#.#.#
###.#############.#######.#.###.#.#.###.#.#.#####.#.###.#.#.#.#####Q###.###M#.###
#...#.....#.......#..j#...#.#.....#.#...#...#.....#...#.#.#.#.#.....#...#...#...#
#.#####.#.###.#######.#.###.#########.#####.#.#.#####.#.#.#.###.#####.###.###.#.#
#...#...#.....#.....#...#.#.......#...#.#...#.#.#...#.#.#.#.....#.....#.#.#...#.#
###.#.#########.###.#.###.#######.#.###.#.#####.#.#.#.#.###########.###.#.#####.#
#.#.#.............#.#.#.....#....o#.#...#.......#.#.#.#...#.......#.#..h#...#...#
#.#.###############.#.#####.#.###.#.###.###########.#.#.#.#.###.#.#.#.#.###.#.###
#.#...#.........#...#.......#.#...#.D...#...#.......#.#.#...#...#...#.#...#.#...#
#.###.#.#######.#.#########.#.#########.#.#.#.###.###.#######.#######.#.###.###L#
#.......#.........#.........#..........n#.#.....#.............#.......#.........#
#################################################################################
2019/day18/prompt.txt
-225
View File
@@ -1,225 +0,0 @@
--- Day 18: Many-Worlds Interpretation ---
As you approach Neptune, a planetary security system detects you and activates a giant tractor beam on Triton! You have no choice but to land.
A scan of the local area reveals only one interesting feature: a massive underground vault. You generate a map of the tunnels (your puzzle input). The tunnels are too narrow to move diagonally.
Only one entrance (marked @) is present among the open passages (marked .) and stone walls (#), but you also detect an assortment of keys (shown as lowercase letters) and doors (shown as uppercase letters). Keys of a given letter open the door of the same letter: a opens A, b opens B, and so on. You aren't sure which key you need to disable the tractor beam, so you'll need to collect all of them.
For example, suppose you have the following map:
#########
#b.A.@.a#
#########
Starting from the entrance (@), you can only access a large door (A) and a key (a). Moving toward the door doesn't help you, but you can move 2 steps to collect the key, unlocking A in the process:
#########
#b.....@#
#########
Then, you can move 6 steps to collect the only other key, b:
#########
#@......#
#########
So, collecting every key took a total of 8 steps.
Here is a larger example:
########################
#f.D.E.e.C.b.A.@.a.B.c.#
######################.#
#d.....................#
########################
The only reasonable move is to take key a and unlock door A:
########################
#f.D.E.e.C.b.....@.B.c.#
######################.#
#d.....................#
########################
Then, do the same with key b:
########################
#f.D.E.e.C.@.........c.#
######################.#
#d.....................#
########################
...and the same with key c:
########################
#f.D.E.e.............@.#
######################.#
#d.....................#
########################
Now, you have a choice between keys d and e. While key e is closer, collecting it now would be slower in the long run than collecting key d first, so that's the best choice:
########################
#f...E.e...............#
######################.#
#@.....................#
########################
Finally, collect key e to unlock door E, then collect key f, taking a grand total of 86 steps.
Here are a few more examples:
########################
#...............b.C.D.f#
#.######################
#.....@.a.B.c.d.A.e.F.g#
########################
Shortest path is 132 steps: b, a, c, d, f, e, g
#################
#i.G..c...e..H.p#
########.########
#j.A..b...f..D.o#
########@########
#k.E..a...g..B.n#
########.########
#l.F..d...h..C.m#
#################
Shortest paths are 136 steps;
one is: a, f, b, j, g, n, h, d, l, o, e, p, c, i, k, m
########################
#@..............ac.GI.b#
###d#e#f################
###A#B#C################
###g#h#i################
########################
Shortest paths are 81 steps; one is: a, c, f, i, d, g, b, e, h
How many steps is the shortest path that collects all of the keys?
Your puzzle answer was 6286.
The first half of this puzzle is complete! It provides one gold star: *
--- Part Two ---
You arrive at the vault only to discover that there is not one vault, but four - each with its own entrance.
On your map, find the area in the middle that looks like this:
...
.@.
...
Update your map to instead use the correct data:
@#@
###
@#@
This change will split your map into four separate sections, each with its own entrance:
####### #######
#a.#Cd# #a.#Cd#
##...## ##@#@##
##.@.## --> #######
##...## ##@#@##
#cB#Ab# #cB#Ab#
####### #######
Because some of the keys are for doors in other vaults, it would take much too long to collect all of the keys by yourself. Instead, you deploy four remote-controlled robots. Each starts at one of the entrances (@).
Your goal is still to collect all of the keys in the fewest steps, but now, each robot has its own position and can move independently. You can only remotely control a single robot at a time. Collecting a key instantly unlocks any corresponding doors, regardless of the vault in which the key or door is found.
For example, in the map above, the top-left robot first collects key a, unlocking door A in the bottom-right vault:
#######
#@.#Cd#
##.#@##
#######
##@#@##
#cB#.b#
#######
Then, the bottom-right robot collects key b, unlocking door B in the bottom-left vault:
#######
#@.#Cd#
##.#@##
#######
##@#.##
#c.#.@#
#######
Then, the bottom-left robot collects key c:
#######
#@.#.d#
##.#@##
#######
##.#.##
#@.#.@#
#######
Finally, the top-right robot collects key d:
#######
#@.#.@#
##.#.##
#######
##.#.##
#@.#.@#
#######
In this example, it only took 8 steps to collect all of the keys.
Sometimes, multiple robots might have keys available, or a robot might have to wait for multiple keys to be collected:
###############
#d.ABC.#.....a#
######@#@######
###############
######@#@######
#b.....#.....c#
###############
First, the top-right, bottom-left, and bottom-right robots take turns collecting keys a, b, and c, a total of 6 + 6 + 6 = 18 steps. Then, the top-left robot can access key d, spending another 6 steps; collecting all of the keys here takes a minimum of 24 steps.
Here's a more complex example:
#############
#DcBa.#.GhKl#
#.###@#@#I###
#e#d#####j#k#
###C#@#@###J#
#fEbA.#.FgHi#
#############
Top-left robot collects key a.
Bottom-left robot collects key b.
Top-left robot collects key c.
Bottom-left robot collects key d.
Top-left robot collects key e.
Bottom-left robot collects key f.
Bottom-right robot collects key g.
Top-right robot collects key h.
Bottom-right robot collects key i.
Top-right robot collects key j.
Bottom-right robot collects key k.
Top-right robot collects key l.
In the above example, the fewest steps to collect all of the keys is 32.
Here's an example with more choices:
#############
#g#f.D#..h#l#
#F###e#E###.#
#dCba@#@BcIJ#
#############
#nK.L@#@G...#
#M###N#H###.#
#o#m..#i#jk.#
#############
One solution with the fewest steps is:
Top-left robot collects key e.
Top-right robot collects key h.
Bottom-right robot collects key i.
Top-left robot collects key a.
Top-left robot collects key b.
Top-right robot collects key c.
Top-left robot collects key d.
Top-left robot collects key f.
Top-left robot collects key g.
Bottom-right robot collects key k.
Bottom-right robot collects key j.
Top-right robot collects key l.
Bottom-left robot collects key n.
Bottom-left robot collects key m.
Bottom-left robot collects key o.
This example requires at least 72 steps to collect all keys.
After updating your map and using the remote-controlled robots, what is the fewest steps necessary to collect all of the keys?
2019/day19/input.txt
-1
View File
@@ -1 +0,0 @@
109,424,203,1,21101,11,0,0,1106,0,282,21102,1,18,0,1105,1,259,1202,1,1,221,203,1,21101,0,31,0,1105,1,282,21102,1,38,0,1106,0,259,21001,23,0,2,22102,1,1,3,21102,1,1,1,21102,57,1,0,1106,0,303,2101,0,1,222,21002,221,1,3,21001,221,0,2,21101,0,259,1,21101,80,0,0,1105,1,225,21101,158,0,2,21101,0,91,0,1106,0,303,1201,1,0,223,20102,1,222,4,21101,259,0,3,21101,225,0,2,21102,225,1,1,21101,118,0,0,1106,0,225,20102,1,222,3,21101,0,79,2,21102,1,133,0,1106,0,303,21202,1,-1,1,22001,223,1,1,21101,148,0,0,1105,1,259,2102,1,1,223,21001,221,0,4,20102,1,222,3,21101,16,0,2,1001,132,-2,224,1002,224,2,224,1001,224,3,224,1002,132,-1,132,1,224,132,224,21001,224,1,1,21101,0,195,0,106,0,108,20207,1,223,2,20101,0,23,1,21102,-1,1,3,21102,214,1,0,1106,0,303,22101,1,1,1,204,1,99,0,0,0,0,109,5,1201,-4,0,249,21202,-3,1,1,21201,-2,0,2,22101,0,-1,3,21101,250,0,0,1106,0,225,21202,1,1,-4,109,-5,2105,1,0,109,3,22107,0,-2,-1,21202,-1,2,-1,21201,-1,-1,-1,22202,-1,-2,-2,109,-3,2106,0,0,109,3,21207,-2,0,-1,1206,-1,294,104,0,99,21202,-2,1,-2,109,-3,2106,0,0,109,5,22207,-3,-4,-1,1206,-1,346,22201,-4,-3,-4,21202,-3,-1,-1,22201,-4,-1,2,21202,2,-1,-1,22201,-4,-1,1,22101,0,-2,3,21102,343,1,0,1106,0,303,1106,0,415,22207,-2,-3,-1,1206,-1,387,22201,-3,-2,-3,21202,-2,-1,-1,22201,-3,-1,3,21202,3,-1,-1,22201,-3,-1,2,22101,0,-4,1,21101,384,0,0,1105,1,303,1105,1,415,21202,-4,-1,-4,22201,-4,-3,-4,22202,-3,-2,-2,22202,-2,-4,-4,22202,-3,-2,-3,21202,-4,-1,-2,22201,-3,-2,1,21202,1,1,-4,109,-5,2106,0,0
2019/day19/prompt.txt
-78
View File
@@ -1,78 +0,0 @@
--- Day 19: Tractor Beam ---
Unsure of the state of Santa's ship, you borrowed the tractor beam technology from Triton. Time to test it out.
When you're safely away from anything else, you activate the tractor beam, but nothing happens. It's hard to tell whether it's working if there's nothing to use it on. Fortunately, your ship's drone system can be configured to deploy a drone to specific coordinates and then check whether it's being pulled. There's even an Intcode program (your puzzle input) that gives you access to the drone system.
The program uses two input instructions to request the X and Y position to which the drone should be deployed. Negative numbers are invalid and will confuse the drone; all numbers should be zero or positive.
Then, the program will output whether the drone is stationary (0) or being pulled by something (1). For example, the coordinate X=0, Y=0 is directly in front of the tractor beam emitter, so the drone control program will always report 1 at that location.
To better understand the tractor beam, it is important to get a good picture of the beam itself. For example, suppose you scan the 10x10 grid of points closest to the emitter:
X
0-> 9
0#.........
|.#........
v..##......
...###....
....###...
Y .....####.
......####
......####
.......###
9........##
In this example, the number of points affected by the tractor beam in the 10x10 area closest to the emitter is 27.
However, you'll need to scan a larger area to understand the shape of the beam. How many points are affected by the tractor beam in the 50x50 area closest to the emitter? (For each of X and Y, this will be 0 through 49.)
Your puzzle answer was 126.
--- Part Two ---
You aren't sure how large Santa's ship is. You aren't even sure if you'll need to use this thing on Santa's ship, but it doesn't hurt to be prepared. You figure Santa's ship might fit in a 100x100 square.
The beam gets wider as it travels away from the emitter; you'll need to be a minimum distance away to fit a square of that size into the beam fully. (Don't rotate the square; it should be aligned to the same axes as the drone grid.)
For example, suppose you have the following tractor beam readings:
#.......................................
.#......................................
..##....................................
...###..................................
....###.................................
.....####...............................
......#####.............................
......######............................
.......#######..........................
........########........................
.........#########......................
..........#########.....................
...........##########...................
...........############.................
............############................
.............#############..............
..............##############............
...............###############..........
................###############.........
................#################.......
.................########OOOOOOOOOO.....
..................#######OOOOOOOOOO#....
...................######OOOOOOOOOO###..
....................#####OOOOOOOOOO#####
.....................####OOOOOOOOOO#####
.....................####OOOOOOOOOO#####
......................###OOOOOOOOOO#####
.......................##OOOOOOOOOO#####
........................#OOOOOOOOOO#####
.........................OOOOOOOOOO#####
..........................##############
..........................##############
...........................#############
............................############
.............................###########
In this example, the 10x10 square closest to the emitter that fits entirely within the tractor beam has been marked O. Within it, the point closest to the emitter (the only highlighted O) is at X=25, Y=20.
Find the 100x100 square closest to the emitter that fits entirely within the tractor beam; within that square, find the point closest to the emitter. What value do you get if you take that point's X coordinate, multiply it by 10000, then add the point's Y coordinate? (In the example above, this would be 250020.)
Your puzzle answer was 11351625.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day20/input.txt
-123
View File
@@ -1,123 +0,0 @@
S U A R G V B L
X Y A U T M Y G
#######################################.#######.#.###.#####.#####.#######.#######.#####################################
#...#.#.#...................#...#.#...#...#.#.#.#.....#...#...#...#.#.......#.....#...#...#.....#.........#.....#...#.#
###.#.#.###.###.#####.###.#####.#.#.#.#.###.#.#.#.#####.#.###.#.###.#######.#.###.#.#####.###.###.#####.#.#.#####.#.#.#
#.............#.#.....#.............#...#...#.#.#.#...#.#.#...#.....#...#.#.#...#.......#.........#...#.#.#...#.#.#.#.#
###.#####.#.#.#.#.#.#####.#####.#.#######.#.###.#.#.#.#.#.#.###.#.#.###.#.#.###.#####.###.#########.#########.#.###.#.#
#...#.....#.#.#.#.#.#.....#...#.#.....#.#.#.....#...#.#.#.#...#.#.#...#.#...#.......#.#.........#.....#.....#...#.....#
#.#####.###.#.###############.###.#####.#.###########.#.#.#.###.###.###.#.#####.#.#.###.#####.###.#########.#.#.#####.#
#.#.#.....#.#.#.........................#.......#.#...#.#.....#.#.#...#.....#...#.#...#...#...........#.......#...#.#.#
###.#.#.###########.###########.#######.###.#.#.#.#.###.#####.###.#.#####.###.#########.#######.###########.###.###.#.#
#.....#.#.#...#...#.#.#.#.#.#...#.#.....#...#.#.#...#...#...#.#.......#.....#.#.#.#.#.#.......#.#...#...#...#.#.#.#.#.#
#.###.###.#.#####.###.#.#.#.#.###.#.#.###.#####.#.#.###.#.#########.#.#.###.#.#.#.#.#.#.#.#######.#####.#.#.#.#.#.#.#.#
#.#.....#.#.............#.#.#.#.....#.#.#.#.....#.#.#.#...#.....#.#.#.#.#...#.#.#.......#.#.....#.#.#...#.#.#.#.#...#.#
#####.###.#############.#.#.#####.#.###.###.###.###.#.#.#.#####.#.#.#######.#.#.#.###.#.#.###.###.#.###.###.#.###.###.#
#.#.#.#.#.#.....#.......#.......#.#...#.....#.#.#...#.#.#...#.....#.#.#.#...#.......#.#.#.#.....#...#...#...#.....#...#
#.#.###.#.#.#.#.#####.#.###.###.###.#####.#.#.#.###.#.#.###.###.###.#.#.#.#.###.###########.#####.#.###.###.#.#.#####.#
#.....#...#.#.#...#.#.#...#...#.....#.....#.#.#.#...#.....#.#.........#...#.#.........#.....#...#.#...#.......#.#.....#
#####.#.#####.#.#.#.#.#.#######.###.###.#.###.###.#.#.#.#####.#####.#######.#.#########.#######.#.#####.#############.#
#.#.#...#...#.#.#.#.#.#.........#...#...#...#.....#.#.#.....#.#.#.....#...#.#.....#.........#.#.#.....#.....#.#.#.....#
#.#.###.#.#####.###.###.#####.###.#########.#.###.#######.#####.###.#####.#.#.#####.#.#######.#.#.#.###.#.#.#.#.###.#.#
#.#.#...#.....#...#.....#.#.....#...#.#...#.#.#...#.#.....#...#.......#.#...#...#...#.#.#.#.......#.#...#.#.#.#...#.#.#
#.#.###.#.#####.#####.#.#.#######.###.#.###.###.#.#.###.###.###.#.#.###.#.###.#####.###.#.#.#####.###.#######.#.#####.#
#.....#.#...#.#...#.#.#.#.#.....#...#.........#.#...#.........#.#.#.....#.#.#.#...#.#.#.........#.#.#.#...#...#...#.#.#
###.###.#.###.#.###.#.#.#.#####.#.###.###.###.#####.#######.#######.#####.#.#.#.###.#.#.###.#######.#.#.#.#.#####.#.#.#
#...#.....#.........#.#.#.#.........#.#.#.#.#.#.#.....#.....#.......#.#.....#...........#.....#.#.#...#.#.#...#...#.#.#
###.#.###.#####.#########.###.###.#####.#.#.###.#.#.###.#########.#.#.#####.###.###.###########.#.###.#.###.#####.#.#.#
#.#...#.#...#.#.#...#.#.#.#...#.....#.....#.#.....#.#...#...#.....#.#.......#.....#.#.#.#.#...#.....#...#.....#.....#.#
#.#####.#.###.#.#.###.#.#.#######.#####.#.#.#####.###.#.#.#.###.#####.#########.###.#.#.#.#.###.#####.###.#########.#.#
#.#...#.......#.#.#.....#...........#...#.#.#.#.....#.#...#...#.....#.........#.#.....#.....#.....#...........#.......#
#.#.#######.###.#.###.#.#########.#######.#.#.###.#.#####.#.#.#####.#######.#.###.#######.#.###.#########.#.#####.#.###
#...#...#.#.#.#...#...#.#...#.#.........#.....#...#...#...#.#.#.....#.......#...#.....#...#.#.#...#.#.#...#.#...#.#.#.#
###.###.#.#.#.#.#####.#####.#.#######.###.###########.#######.#.#####.#############.#######.#.#.###.#.###.#####.###.#.#
#.#.#.#...#...#.#...#.#...#...# E X K R X V W #.........#...#...#...#.#...#.#
#.#.#.#.#####.#.#.###.#.###.### N I H F B M D #.###.#######.#.#.###.#.#.###.#
#.....#.....#...........#.....# #.#.....#.....#.#.#.#.#.......#
#.###.#.###.#.#####.#.#.#.###.# #####.#######.#.###.#.###.#.###
#.#...#...#...#.....#.#.#...#..UO QA..#.............#.#.......#.#..MB
#.#.#####.###.###.#.#.#.#.#.### #.#.#.#.###.###.#.#.###.#####.#
HV..#.....#.#.....#.#.#.#.#.#...# #...#.#.#.....#...#.#...#.....#
#######.#.#.#####.#.###.#####.# #########.#.###.#.#.#.#####.#.#
#.#...#...#.#.#...#.#.#.......# #.....#...#.#.#.#...#.#.....#.#
#.#.#########.#######.######### ###.#########.#.#.###.#.#.#.#.#
#.......#...#.......#.....#...# #...#.......#.#.#...#...#.#.#..ZZ
#.#.#.#.#.#.#.#.###.#.###.#.#.# ###.#####.###.#.#.###.#.#######
#.#.#.#...#.#.#.#...#.#.....#.# #...#.#.#.#...#.#.#...#.#.#.#..YX
#.#####.#.#.#.#.#.###.#######.# #.#.#.#.#.#.#.#.#########.#.#.#
#.....#.#.#...#.#.#...#.#.....# GT..#.....#...#.#...#.....#.....#
#.#.#############.###.#.###.### #.#.#.#.#.###.#######.###.#.#.#
XI..#.#.#...#.#...#.......#......AO #.#.#.#...#...#.#.#...#.#.#.#.#
#.#.#.###.#.###.#######.###.#.# ###.#####.#.###.#.###.#.#.#####
#.#.#.......#.........#.#.#.#.# #...#.#...#.................#.#
#####.###.###.#####.#.###.#.### ###.#.###.#.###.#.###.#######.#
WD......#...........#.#.....#.#.# #.#.#.....#.#.#.#.#.#.#...#....AO
#.###.#####.#.###########.###.# #.#########.#.###.#.###.#.#.###
#.#.....#...#...#.........#...# #...#.........#.#.#.#...#.#...#
#.#########.#.#######.#####.#.# #.#############.###.#.#.#.#.#.#
#...#...#.#.#.#...#.........#..MB PI..#...#.#.#.#...#.....#.#.#.#.#
#######.#.#.#####.#.###.#.#.### #.###.#.#.#.#.#####.#.###.###.#
#...#.....#.#.#.#.#...#.#.#.#..UY #...................#.#.......#
#.###.#######.#.#.###########.# #######.#######################
ZY....#...#.....#.#.#.#..........HV RU......#.#...............#...#..PI
#.#.#.#####.#.#.#.#.#####.#.### #####.###.###.###.###.#.#.#.#.#
#.#.....#...#.........#...#...# #...#.#...#.....#.#.#.#...#...#
#.###.#####.###.###.###.###.#.# #.###.#.###.###.#.#.#.#.#######
OQ..#.#.......#.#...#.......#.#.# #.#...#...#...#.#...#.#.....#.#
###.#########.###############.# ###.###.#####.#########.#####.#
#...............#.#.......#...# #.......#...#...#.#...#.#.#...#
#.###.#####.#####.#.#####.##### ###########.#####.###.###.#.###
#.#.#.....#...#.#.....#.....#.# #.............#.#...........#.#
###.###.###.###.#####.#.#####.# #.###.###.#.###.###.#.#####.#.#
#.....#.#...#.#.#.....#.......# OQ..#.....#.#.#.#.....#.....#.#..WA
#.###.#.#.###.#.#.#########.### #.#.#########.#####.#######.#.#
UO..#.#...#.............#.#.#....SX #.#.....#.#...#...#...#.....#.#
###.###############.###.#.##### ###.###.#.###.###.#.#######.#.#
#.......#.........#.#...#.....# #.#.#.#.............#.#.......#
#.#.#.#.#.#.###.#.###.#.#.###.# #.###.#####.#.###.#.#.#######.#
#.#.#.#...#...#.#.....#.....#..BY WA....#.....#.#.#...#...#...#.#.#
#.###############.#######.###.# ###.#.###.###.#########.###.###
RF....#.#.#...#.....#.#.#...#.#.# #...#.#...#.......#...#.#.#.#.#
#####.#.###.#######.#.#####.### #.###.###.###.#####.###.#.#.#.#
#.#.#.#.................#.#....TR #.....#.....#...#.#.....#.#...#
#.#.#.#.#.#.#.###.#.###.#.###.# #.###.###.#######.#.#.###.#.###
XB....#...#.#.#.#...#.#.........# #...#.#.#...........#..........KH
###.#.#.#.#.#####.#####.#.#.### #.#####.#.###.#.#.#.###.#.###.#
#...#.#.#.#.#.....#.#...#.#...# #...#.......#.#.#.#.#.#.#.#...#
###.#.#####.###.#.#.#.#.#.#.### ###.###.#####.#.###.#.#.#####.#
#.......#.....#.#...#.#.#.#...# #...#.....#.#.#...#.#.......#.#
###.#.#####.#.###.#.#####.###.# Z M Y M P L #.#.#.#.###.#.#.###.#.#.#######
#...#.#...#.#.#...#...#...#...# Y W X D S G #.#.#.#.#.....#...#.#.#.......#
###.###.#########.#########################.#######.###.###########.#######.###.###########.###.#.#.#.###.#####.###.###
#.........#...#.......#.#.......#.....#...#.#.#...#.#.........#.......#.#.#.#...#.......#.#...#.#.#.#...#.....#...#...#
#.###.#####.###.#.#.###.###.#########.#.#.#.#.#.#.#.#.#.#.###.###.#.###.#.#.#.#####.#.###.#.#####.###.###.#####.#.#.###
#.#.........#...#.#.#.........#.#.#.....#...#...#...#.#.#...#.#.#.#...#.#...#.....#.#.....#...#.#.#.#.#.#.....#.#.#...#
#####.#.###.#.###.#########.#.#.#.#.###.#####.#.#####.#########.###.###.###.###.###.#.#######.#.###.#.#.###.#####.#.###
#.#...#...#.#.#.....#.#.#...#.#.....#.....#.#.#.#...........#.....#.....#.#.#...#.#.#.#...#.#.#...........#...#...#...#
#.#.#.#.#.###########.#.#.#.###.#.#######.#.#.#######.#.#######.###.#.###.#.#.###.#.###.###.###.###.#####.#.#.###.###.#
#.#.#.#.#.........#.....#.#.#.#.#.#.........#...#.....#.#.#...#.#...#.#.#...#.......#.........#...#...#...#.#...#.#...#
#.#.###.#######.#######.###.#.#.#######.#######.#######.#.#.#.#.#.#####.#.###.###.#.#.###.#########.###.#.#.#####.###.#
#...#.........#.#...#.........#.#.#.....#.#.#.....#.......#.#.#.....#.......#...#.#.....#...#.#...#.#.#.#.#...#.....#.#
###.#.#########.#.#######.#.#.###.###.#.#.#.#.###.#.#.#######.#.#####.#.#.#.#######.###.#.###.#.###.#.###.#.###.#.###.#
#.#.#.#...#...#.#.#.#.#...#.#.........#.#.....#.#.#.#...#.#.........#.#.#.#.#.........#.#.#...#.#.......#.#...#.#.#...#
#.#.###.#####.###.#.#.###.#####.#####.###.###.#.#####.###.#.#.#####.#######.#####.###########.#.###.#######.#####.###.#
#.....#.........#.........#.....#.......#.#.#.....#.#...#.#.#...#.#...#.....#.......#.......#.....#...#.......#.....#.#
#####.#.###.###########.#####.###.###.###.#.#.#####.#.###.#.#.###.#.#######.#####.###.#.#.###.###.#.#####.#.#.###.#.###
#.........#...#.#.......#.#...#...#.....#.#...#...........#.#...#.#.#.#.......#.#.....#.#.#.#...#.#.#...#.#.#...#.#...#
#.###.#########.#.#####.#.###.#.#####.###.#.#.#######.#######.#.#.###.###.###.#.#.#########.#.#####.#.#####.#####.###.#
#...#.......#.....#.#...#.....#.#.......#.#.#...#.....#.......#.#.......#...#.#.#.#.#...........#.......#.#...#...#...#
#.#.###.###.#.#####.###########.#####.#.#####.#######.###.###.#########.#.#####.#.#.#.#.###########.#####.#.#.#.#.#.###
#.#.#...#...#.#.........#.#...#.#.#.#.#.#...........#...#.#.#...#...........#.........#.....#...#.........#.#.#.#.#...#
#.#.#.###.#############.#.#.#####.#.#.###.#.#.#########.###.#.#############.#.#####.###.#####.###.#.#.###.###.#######.#
#.#.#...#.#.#.#.#.....#.#.#.#...#.......#.#.#.#.#.....#.....#...#.#.#...#...#...#...#.#.#.#.....#.#.#...#.#.........#.#
###.#.#.###.#.#.#####.#.#.#.###.#####.#.#####.#.#.###.#####.#.###.#.#.###.#.###.#####.###.#.#########.#.###.###.###.#.#
#.#.#.#.#.....#.#.....................#...#.....#.#.#.......#...#...#...#.#.#.......#...............#.#.#.....#...#.#.#
#.#.#########.#.#.#.#.###.#####.#.###.#######.#####.###.#####.#####.#.#.#.#.#.#######.###.#.###.###.###########.#####.#
#.....#...#.......#.#.#.....#.#.#.#.....#.#.#.#.....#.#.#.#.#...#.....#...#.#.........#.#.#.#...#.....#.......#...#...#
#.#######.#.#####.###.#######.#######.###.#.#.###.###.#.#.#.###.#####.###.###.#########.#.###.#.#####.#.#######.#.###.#
#.#...#...#.#.....#...#.............#.#.....#.......#.....#.#.......#.#.#.#.............#...#.#...#.......#.#.#.#...#.#
#.#.#.#.#.#.#####.###.#####.#######.#.#.#.#########.#.#####.#######.#.#.#####.###############.#.#.#.###.###.#.#####.###
#.#.#...#.....#...#...#.....#...........#.....#.....#.......#.......#...#...................#.#.#.#...#...........#...#
###########################################.###.#########.#######.#####.#########.#####################################
M T P Q M E
W R S A D N
2019/day20/prompt.txt
-203
View File
@@ -1,203 +0,0 @@
--- Day 20: Donut Maze ---
You notice a strange pattern on the surface of Pluto and land nearby to get a closer look. Upon closer inspection, you realize you've come across one of the famous space-warping mazes of the long-lost Pluto civilization!
Because there isn't much space on Pluto, the civilization that used to live here thrived by inventing a method for folding spacetime. Although the technology is no longer understood, mazes like this one provide a small glimpse into the daily life of an ancient Pluto citizen.
This maze is shaped like a donut. Portals along the inner and outer edge of the donut can instantly teleport you from one side to the other. For example:
A
A
#######.#########
#######.........#
#######.#######.#
#######.#######.#
#######.#######.#
##### B ###.#
BC...## C ###.#
##.## ###.#
##...DE F ###.#
##### G ###.#
#########.#####.#
DE..#######...###.#
#.#########.###.#
FG..#########.....#
###########.#####
Z
Z
This map of the maze shows solid walls (#) and open passages (.). Every maze on Pluto has a start (the open tile next to AA) and an end (the open tile next to ZZ). Mazes on Pluto also have portals; this maze has three pairs of portals: BC, DE, and FG. When on an open tile next to one of these labels, a single step can take you to the other tile with the same label. (You can only walk on . tiles; labels and empty space are not traversable.)
One path through the maze doesn't require any portals. Starting at AA, you could go down 1, right 8, down 12, left 4, and down 1 to reach ZZ, a total of 26 steps.
However, there is a shorter path: You could walk from AA to the inner BC portal (4 steps), warp to the outer BC portal (1 step), walk to the inner DE (6 steps), warp to the outer DE (1 step), walk to the outer FG (4 steps), warp to the inner FG (1 step), and finally walk to ZZ (6 steps). In total, this is only 23 steps.
Here is a larger example:
A
A
#################.#############
#.#...#...................#.#.#
#.#.#.###.###.###.#########.#.#
#.#.#.......#...#.....#.#.#...#
#.#########.###.#####.#.#.###.#
#.............#.#.....#.......#
###.###########.###.#####.#.#.#
#.....# A C #.#.#.#
####### S P #####.#
#.#...# #......VT
#.#.#.# #.#####
#...#.# YN....#.#
#.###.# #####.#
DI....#.# #.....#
#####.# #.###.#
ZZ......# QG....#..AS
###.### #######
JO..#.#.# #.....#
#.#.#.# ###.#.#
#...#..DI BU....#..LF
#####.# #.#####
YN......# VT..#....QG
#.###.# #.###.#
#.#...# #.....#
###.### J L J #.#.###
#.....# O F P #.#...#
#.###.#####.#.#####.#####.###.#
#...#.#.#...#.....#.....#.#...#
#.#####.###.###.#.#.#########.#
#...#.#.....#...#.#.#.#.....#.#
#.###.#####.###.###.#.#.#######
#.#.........#...#.............#
#########.###.###.#############
B J C
U P P
Here, AA has no direct path to ZZ, but it does connect to AS and CP. By passing through AS, QG, BU, and JO, you can reach ZZ in 58 steps.
In your maze, how many steps does it take to get from the open tile marked AA to the open tile marked ZZ?
Your puzzle answer was 600.
--- Part Two ---
Strangely, the exit isn't open when you reach it. Then, you remember: the ancient Plutonians were famous for building recursive spaces.
The marked connections in the maze aren't portals: they physically connect to a larger or smaller copy of the maze. Specifically, the labeled tiles around the inside edge actually connect to a smaller copy of the same maze, and the smaller copy's inner labeled tiles connect to yet a smaller copy, and so on.
When you enter the maze, you are at the outermost level; when at the outermost level, only the outer labels AA and ZZ function (as the start and end, respectively); all other outer labeled tiles are effectively walls. At any other level, AA and ZZ count as walls, but the other outer labeled tiles bring you one level outward.
Your goal is to find a path through the maze that brings you back to ZZ at the outermost level of the maze.
In the first example above, the shortest path is now the loop around the right side. If the starting level is 0, then taking the previously-shortest path would pass through BC (to level 1), DE (to level 2), and FG (back to level 1). Because this is not the outermost level, ZZ is a wall, and the only option is to go back around to BC, which would only send you even deeper into the recursive maze.
In the second example above, there is no path that brings you to ZZ at the outermost level.
Here is a more interesting example:
Z L X W C
Z P Q B K
###########.#.#.#.#######.###############
#...#.......#.#.......#.#.......#.#.#...#
###.#.#.#.#.#.#.#.###.#.#.#######.#.#.###
#.#...#.#.#...#.#.#...#...#...#.#.......#
#.###.#######.###.###.#.###.###.#.#######
#...#.......#.#...#...#.............#...#
#.#########.#######.#.#######.#######.###
#...#.# F R I Z #.#.#.#
#.###.# D E C H #.#.#.#
#.#...# #...#.#
#.###.# #.###.#
#.#....OA WB..#.#..ZH
#.###.# #.#.#.#
CJ......# #.....#
####### #######
#.#....CK #......IC
#.###.# #.###.#
#.....# #...#.#
###.### #.#.#.#
XF....#.# RF..#.#.#
#####.# #######
#......CJ NM..#...#
###.#.# #.###.#
RE....#.# #......RF
###.### X X L #.#.#.#
#.....# F Q P #.#.#.#
###.###########.###.#######.#########.###
#.....#...#.....#.......#...#.....#.#...#
#####.#.###.#######.#######.###.###.#.#.#
#.......#.......#.#.#.#.#...#...#...#.#.#
#####.###.#####.#.#.#.#.###.###.#.###.###
#.......#.....#.#...#...............#...#
#############.#.#.###.###################
A O F N
A A D M
One shortest path through the maze is the following:
Walk from AA to XF (16 steps)
Recurse into level 1 through XF (1 step)
Walk from XF to CK (10 steps)
Recurse into level 2 through CK (1 step)
Walk from CK to ZH (14 steps)
Recurse into level 3 through ZH (1 step)
Walk from ZH to WB (10 steps)
Recurse into level 4 through WB (1 step)
Walk from WB to IC (10 steps)
Recurse into level 5 through IC (1 step)
Walk from IC to RF (10 steps)
Recurse into level 6 through RF (1 step)
Walk from RF to NM (8 steps)
Recurse into level 7 through NM (1 step)
Walk from NM to LP (12 steps)
Recurse into level 8 through LP (1 step)
Walk from LP to FD (24 steps)
Recurse into level 9 through FD (1 step)
Walk from FD to XQ (8 steps)
Recurse into level 10 through XQ (1 step)
Walk from XQ to WB (4 steps)
Return to level 9 through WB (1 step)
Walk from WB to ZH (10 steps)
Return to level 8 through ZH (1 step)
Walk from ZH to CK (14 steps)
Return to level 7 through CK (1 step)
Walk from CK to XF (10 steps)
Return to level 6 through XF (1 step)
Walk from XF to OA (14 steps)
Return to level 5 through OA (1 step)
Walk from OA to CJ (8 steps)
Return to level 4 through CJ (1 step)
Walk from CJ to RE (8 steps)
Return to level 3 through RE (1 step)
Walk from RE to IC (4 steps)
Recurse into level 4 through IC (1 step)
Walk from IC to RF (10 steps)
Recurse into level 5 through RF (1 step)
Walk from RF to NM (8 steps)
Recurse into level 6 through NM (1 step)
Walk from NM to LP (12 steps)
Recurse into level 7 through LP (1 step)
Walk from LP to FD (24 steps)
Recurse into level 8 through FD (1 step)
Walk from FD to XQ (8 steps)
Recurse into level 9 through XQ (1 step)
Walk from XQ to WB (4 steps)
Return to level 8 through WB (1 step)
Walk from WB to ZH (10 steps)
Return to level 7 through ZH (1 step)
Walk from ZH to CK (14 steps)
Return to level 6 through CK (1 step)
Walk from CK to XF (10 steps)
Return to level 5 through XF (1 step)
Walk from XF to OA (14 steps)
Return to level 4 through OA (1 step)
Walk from OA to CJ (8 steps)
Return to level 3 through CJ (1 step)
Walk from CJ to RE (8 steps)
Return to level 2 through RE (1 step)
Walk from RE to XQ (14 steps)
Return to level 1 through XQ (1 step)
Walk from XQ to FD (8 steps)
Return to level 0 through FD (1 step)
Walk from FD to ZZ (18 steps)
This path takes a total of 396 steps to move from AA at the outermost layer to ZZ at the outermost layer.
In your maze, when accounting for recursion, how many steps does it take to get from the open tile marked AA to the open tile marked ZZ, both at the outermost layer?
Your puzzle answer was 6666.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day21/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day21/prompt.txt
-101
View File
@@ -1,101 +0,0 @@
--- Day 21: Springdroid Adventure ---
You lift off from Pluto and start flying in the direction of Santa.
While experimenting further with the tractor beam, you accidentally pull an asteroid directly into your ship! It deals significant damage to your hull and causes your ship to begin tumbling violently.
You can send a droid out to investigate, but the tumbling is causing enough artificial gravity that one wrong step could send the droid through a hole in the hull and flying out into space.
The clear choice for this mission is a droid that can jump over the holes in the hull - a springdroid.
You can use an Intcode program (your puzzle input) running on an ASCII-capable computer to program the springdroid. However, springdroids don't run Intcode; instead, they run a simplified assembly language called springscript.
While a springdroid is certainly capable of navigating the artificial gravity and giant holes, it has one downside: it can only remember at most 15 springscript instructions.
The springdroid will move forward automatically, constantly thinking about whether to jump. The springscript program defines the logic for this decision.
Springscript programs only use Boolean values, not numbers or strings. Two registers are available: T, the temporary value register, and J, the jump register. If the jump register is true at the end of the springscript program, the springdroid will try to jump. Both of these registers start with the value false.
Springdroids have a sensor that can detect whether there is ground at various distances in the direction it is facing; these values are provided in read-only registers. Your springdroid can detect ground at four distances: one tile away (A), two tiles away (B), three tiles away (C), and four tiles away (D). If there is ground at the given distance, the register will be true; if there is a hole, the register will be false.
There are only three instructions available in springscript:
AND X Y sets Y to true if both X and Y are true; otherwise, it sets Y to false.
OR X Y sets Y to true if at least one of X or Y is true; otherwise, it sets Y to false.
NOT X Y sets Y to true if X is false; otherwise, it sets Y to false.
In all three instructions, the second argument (Y) needs to be a writable register (either T or J). The first argument (X) can be any register (including A, B, C, or D).
For example, the one-instruction program NOT A J means "if the tile immediately in front of me is not ground, jump".
Or, here is a program that jumps if a three-tile-wide hole (with ground on the other side of the hole) is detected:
NOT A J
NOT B T
AND T J
NOT C T
AND T J
AND D J
The Intcode program expects ASCII inputs and outputs. It will begin by displaying a prompt; then, input the desired instructions one per line. End each line with a newline (ASCII code 10). When you have finished entering your program, provide the command WALK followed by a newline to instruct the springdroid to begin surveying the hull.
If the springdroid falls into space, an ASCII rendering of the last moments of its life will be produced. In these, @ is the springdroid, # is hull, and . is empty space. For example, suppose you program the springdroid like this:
NOT D J
WALK
This one-instruction program sets J to true if and only if there is no ground four tiles away. In other words, it attempts to jump into any hole it finds:
.................
.................
@................
#####.###########
.................
.................
.@...............
#####.###########
.................
..@..............
.................
#####.###########
...@.............
.................
.................
#####.###########
.................
....@............
.................
#####.###########
.................
.................
.....@...........
#####.###########
.................
.................
.................
#####@###########
However, if the springdroid successfully makes it across, it will use an output instruction to indicate the amount of damage to the hull as a single giant integer outside the normal ASCII range.
Program the springdroid with logic that allows it to survey the hull without falling into space. What amount of hull damage does it report?
Your puzzle answer was 19350938.
--- Part Two ---
There are many areas the springdroid can't reach. You flip through the manual and discover a way to increase its sensor range.
Instead of ending your springcode program with WALK, use RUN. Doing this will enable extended sensor mode, capable of sensing ground up to nine tiles away. This data is available in five new read-only registers:
Register E indicates whether there is ground five tiles away.
Register F indicates whether there is ground six tiles away.
Register G indicates whether there is ground seven tiles away.
Register H indicates whether there is ground eight tiles away.
Register I indicates whether there is ground nine tiles away.
All other functions remain the same.
Successfully survey the rest of the hull by ending your program with RUN. What amount of hull damage does the springdroid now report?
Your puzzle answer was 1142986901.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day22/input.txt
-100
View File
@@ -1,100 +0,0 @@
deal into new stack
deal with increment 21
cut -1639
deal with increment 32
cut -873
deal with increment 8
deal into new stack
cut -7730
deal with increment 8
cut -8408
deal with increment 42
cut -4951
deal into new stack
deal with increment 24
cut -6185
deal with increment 69
cut -930
deal into new stack
cut 8675
deal with increment 47
cut -4543
deal with increment 62
deal into new stack
deal with increment 23
cut 7128
deal with increment 29
deal into new stack
deal with increment 65
cut 8232
deal with increment 34
deal into new stack
deal with increment 7
deal into new stack
cut -5590
deal with increment 34
cut -3523
deal with increment 24
cut 8446
deal with increment 42
cut 6714
deal into new stack
deal with increment 60
cut 1977
deal with increment 51
cut 2719
deal with increment 45
cut 9563
deal with increment 33
cut 9036
deal with increment 70
cut 3372
deal with increment 60
cut 9686
deal with increment 7
cut 9344
deal with increment 13
cut 797
deal with increment 12
cut -6989
deal with increment 43
deal into new stack
cut 1031
deal with increment 14
cut -1145
deal with increment 26
cut -9008
deal with increment 14
cut 432
deal with increment 46
cut -65
deal with increment 50
cut -704
deal with increment 4
cut 7372
deal with increment 66
cut 690
deal with increment 60
cut -7137
deal with increment 66
cut 9776
deal with increment 30
cut 3532
deal with increment 62
cut 4768
deal with increment 13
deal into new stack
cut -9014
deal with increment 68
cut -9601
deal with increment 6
cut -7535
deal with increment 74
cut 9479
deal with increment 6
cut -1879
deal with increment 33
cut 3675
deal with increment 19
cut -937
deal with increment 42
2019/day22/prompt.txt
-154
View File
@@ -1,154 +0,0 @@
--- Day 22: Slam Shuffle ---
There isn't much to do while you wait for the droids to repair your ship. At least you're drifting in the right direction. You decide to practice a new card shuffle you've been working on.
Digging through the ship's storage, you find a deck of space cards! Just like any deck of space cards, there are 10007 cards in the deck numbered 0 through 10006. The deck must be new - they're still in factory order, with 0 on the top, then 1, then 2, and so on, all the way through to 10006 on the bottom.
You've been practicing three different techniques that you use while shuffling. Suppose you have a deck of only 10 cards (numbered 0 through 9):
To deal into new stack, create a new stack of cards by dealing the top card of the deck onto the top of the new stack repeatedly until you run out of cards:
Top Bottom
0 1 2 3 4 5 6 7 8 9 Your deck
New stack
1 2 3 4 5 6 7 8 9 Your deck
0 New stack
2 3 4 5 6 7 8 9 Your deck
1 0 New stack
3 4 5 6 7 8 9 Your deck
2 1 0 New stack
Several steps later...
9 Your deck
8 7 6 5 4 3 2 1 0 New stack
Your deck
9 8 7 6 5 4 3 2 1 0 New stack
Finally, pick up the new stack you've just created and use it as the deck for the next technique.
To cut N cards, take the top N cards off the top of the deck and move them as a single unit to the bottom of the deck, retaining their order. For example, to cut 3:
Top Bottom
0 1 2 3 4 5 6 7 8 9 Your deck
3 4 5 6 7 8 9 Your deck
0 1 2 Cut cards
3 4 5 6 7 8 9 Your deck
0 1 2 Cut cards
3 4 5 6 7 8 9 0 1 2 Your deck
You've also been getting pretty good at a version of this technique where N is negative! In that case, cut (the absolute value of) N cards from the bottom of the deck onto the top. For example, to cut -4:
Top Bottom
0 1 2 3 4 5 6 7 8 9 Your deck
0 1 2 3 4 5 Your deck
6 7 8 9 Cut cards
0 1 2 3 4 5 Your deck
6 7 8 9 Cut cards
6 7 8 9 0 1 2 3 4 5 Your deck
To deal with increment N, start by clearing enough space on your table to lay out all of the cards individually in a long line. Deal the top card into the leftmost position. Then, move N positions to the right and deal the next card there. If you would move into a position past the end of the space on your table, wrap around and keep counting from the leftmost card again. Continue this process until you run out of cards.
For example, to deal with increment 3:
0 1 2 3 4 5 6 7 8 9 Your deck
. . . . . . . . . . Space on table
^ Current position
Deal the top card to the current position:
1 2 3 4 5 6 7 8 9 Your deck
0 . . . . . . . . . Space on table
^ Current position
Move the current position right 3:
1 2 3 4 5 6 7 8 9 Your deck
0 . . . . . . . . . Space on table
^ Current position
Deal the top card:
2 3 4 5 6 7 8 9 Your deck
0 . . 1 . . . . . . Space on table
^ Current position
Move right 3 and deal:
3 4 5 6 7 8 9 Your deck
0 . . 1 . . 2 . . . Space on table
^ Current position
Move right 3 and deal:
4 5 6 7 8 9 Your deck
0 . . 1 . . 2 . . 3 Space on table
^ Current position
Move right 3, wrapping around, and deal:
5 6 7 8 9 Your deck
0 . 4 1 . . 2 . . 3 Space on table
^ Current position
And so on:
0 7 4 1 8 5 2 9 6 3 Space on table
Positions on the table which already contain cards are still counted; they're not skipped. Of course, this technique is carefully designed so it will never put two cards in the same position or leave a position empty.
Finally, collect the cards on the table so that the leftmost card ends up at the top of your deck, the card to its right ends up just below the top card, and so on, until the rightmost card ends up at the bottom of the deck.
The complete shuffle process (your puzzle input) consists of applying many of these techniques. Here are some examples that combine techniques; they all start with a factory order deck of 10 cards:
deal with increment 7
deal into new stack
deal into new stack
Result: 0 3 6 9 2 5 8 1 4 7
cut 6
deal with increment 7
deal into new stack
Result: 3 0 7 4 1 8 5 2 9 6
deal with increment 7
deal with increment 9
cut -2
Result: 6 3 0 7 4 1 8 5 2 9
deal into new stack
cut -2
deal with increment 7
cut 8
cut -4
deal with increment 7
cut 3
deal with increment 9
deal with increment 3
cut -1
Result: 9 2 5 8 1 4 7 0 3 6
Positions within the deck count from 0 at the top, then 1 for the card immediately below the top card, and so on to the bottom. (That is, cards start in the position matching their number.)
After shuffling your factory order deck of 10007 cards, what is the position of card 2019?
Your puzzle answer was 3143.
--- Part Two ---
After a while, you realize your shuffling skill won't improve much more with merely a single deck of cards. You ask every 3D printer on the ship to make you some more cards while you check on the ship repairs. While reviewing the work the droids have finished so far, you think you see Halley's Comet fly past!
When you get back, you discover that the 3D printers have combined their power to create for you a single, giant, brand new, factory order deck of 119315717514047 space cards.
Finally, a deck of cards worthy of shuffling!
You decide to apply your complete shuffle process (your puzzle input) to the deck 101741582076661 times in a row.
You'll need to be careful, though - one wrong move with this many cards and you might overflow your entire ship!
After shuffling your new, giant, factory order deck that many times, what number is on the card that ends up in position 2020?
Your puzzle answer was 3920265924568.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day23/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day23/prompt.txt
-33
View File
@@ -1,33 +0,0 @@
--- Day 23: Category Six ---
The droids have finished repairing as much of the ship as they can. Their report indicates that this was a Category 6 disaster - not because it was that bad, but because it destroyed the stockpile of Category 6 network cables as well as most of the ship's network infrastructure.
You'll need to rebuild the network from scratch.
The computers on the network are standard Intcode computers that communicate by sending packets to each other. There are 50 of them in total, each running a copy of the same Network Interface Controller (NIC) software (your puzzle input). The computers have network addresses 0 through 49; when each computer boots up, it will request its network address via a single input instruction. Be sure to give each computer a unique network address.
Once a computer has received its network address, it will begin doing work and communicating over the network by sending and receiving packets. All packets contain two values named X and Y. Packets sent to a computer are queued by the recipient and read in the order they are received.
To send a packet to another computer, the NIC will use three output instructions that provide the destination address of the packet followed by its X and Y values. For example, three output instructions that provide the values 10, 20, 30 would send a packet with X=20 and Y=30 to the computer with address 10.
To receive a packet from another computer, the NIC will use an input instruction. If the incoming packet queue is empty, provide -1. Otherwise, provide the X value of the next packet; the computer will then use a second input instruction to receive the Y value for the same packet. Once both values of the packet are read in this way, the packet is removed from the queue.
Note that these input and output instructions never block. Specifically, output instructions do not wait for the sent packet to be received - the computer might send multiple packets before receiving any. Similarly, input instructions do not wait for a packet to arrive - if no packet is waiting, input instructions should receive -1.
Boot up all 50 computers and attach them to your network. What is the Y value of the first packet sent to address 255?
Your puzzle answer was 15969.
--- Part Two ---
Packets sent to address 255 are handled by a device called a NAT (Not Always Transmitting). The NAT is responsible for managing power consumption of the network by blocking certain packets and watching for idle periods in the computers.
If a packet would be sent to address 255, the NAT receives it instead. The NAT remembers only the last packet it receives; that is, the data in each packet it receives overwrites the NAT's packet memory with the new packet's X and Y values.
The NAT also monitors all computers on the network. If all computers have empty incoming packet queues and are continuously trying to receive packets without sending packets, the network is considered idle.
Once the network is idle, the NAT sends only the last packet it received to address 0; this will cause the computers on the network to resume activity. In this way, the NAT can throttle power consumption of the network when the ship needs power in other areas.
Monitor packets released to the computer at address 0 by the NAT. What is the first Y value delivered by the NAT to the computer at address 0 twice in a row?
Your puzzle answer was 10650.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day24/input.txt
-5
View File
@@ -1,5 +0,0 @@
#.#.#
.#...
...#.
.###.
###.#
2019/day24/prompt.txt
-223
View File
@@ -1,223 +0,0 @@
--- Day 24: Planet of Discord ---
You land on Eris, your last stop before reaching Santa. As soon as you do, your sensors start picking up strange life forms moving around: Eris is infested with bugs! With an over 24-hour roundtrip for messages between you and Earth, you'll have to deal with this problem on your own.
Eris isn't a very large place; a scan of the entire area fits into a 5x5 grid (your puzzle input). The scan shows bugs (#) and empty spaces (.).
Each minute, The bugs live and die based on the number of bugs in the four adjacent tiles:
A bug dies (becoming an empty space) unless there is exactly one bug adjacent to it.
An empty space becomes infested with a bug if exactly one or two bugs are adjacent to it.
Otherwise, a bug or empty space remains the same. (Tiles on the edges of the grid have fewer than four adjacent tiles; the missing tiles count as empty space.) This process happens in every location simultaneously; that is, within the same minute, the number of adjacent bugs is counted for every tile first, and then the tiles are updated.
Here are the first few minutes of an example scenario:
Initial state:
....#
#..#.
#..##
..#..
#....
After 1 minute:
#..#.
####.
###.#
##.##
.##..
After 2 minutes:
#####
....#
....#
...#.
#.###
After 3 minutes:
#....
####.
...##
#.##.
.##.#
After 4 minutes:
####.
....#
##..#
.....
##...
To understand the nature of the bugs, watch for the first time a layout of bugs and empty spaces matches any previous layout. In the example above, the first layout to appear twice is:
.....
.....
.....
#....
.#...
To calculate the biodiversity rating for this layout, consider each tile left-to-right in the top row, then left-to-right in the second row, and so on. Each of these tiles is worth biodiversity points equal to increasing powers of two: 1, 2, 4, 8, 16, 32, and so on. Add up the biodiversity points for tiles with bugs; in this example, the 16th tile (32768 points) and 22nd tile (2097152 points) have bugs, a total biodiversity rating of 2129920.
What is the biodiversity rating for the first layout that appears twice?
Your puzzle answer was 11042850.
--- Part Two ---
After careful analysis, one thing is certain: you have no idea where all these bugs are coming from.
Then, you remember: Eris is an old Plutonian settlement! Clearly, the bugs are coming from recursively-folded space.
This 5x5 grid is only one level in an infinite number of recursion levels. The tile in the middle of the grid is actually another 5x5 grid, the grid in your scan is contained as the middle tile of a larger 5x5 grid, and so on. Two levels of grids look like this:
| | | |
| | | |
| | | |
-----+-----+---------+-----+-----
| | | |
| | | |
| | | |
-----+-----+---------+-----+-----
| | | | | | | |
| |-+-+-+-+-| |
| | | | | | | |
| |-+-+-+-+-| |
| | | |?| | | |
| |-+-+-+-+-| |
| | | | | | | |
| |-+-+-+-+-| |
| | | | | | | |
-----+-----+---------+-----+-----
| | | |
| | | |
| | | |
-----+-----+---------+-----+-----
| | | |
| | | |
| | | |
(To save space, some of the tiles are not drawn to scale.) Remember, this is only a small part of the infinitely recursive grid; there is a 5x5 grid that contains this diagram, and a 5x5 grid that contains that one, and so on. Also, the ? in the diagram contains another 5x5 grid, which itself contains another 5x5 grid, and so on.
The scan you took (your puzzle input) shows where the bugs are on a single level of this structure. The middle tile of your scan is empty to accommodate the recursive grids within it. Initially, no other levels contain bugs.
Tiles still count as adjacent if they are directly up, down, left, or right of a given tile. Some tiles have adjacent tiles at a recursion level above or below its own level. For example:
| | | |
1 | 2 | 3 | 4 | 5
| | | |
-----+-----+---------+-----+-----
| | | |
6 | 7 | 8 | 9 | 10
| | | |
-----+-----+---------+-----+-----
| |A|B|C|D|E| |
| |-+-+-+-+-| |
| |F|G|H|I|J| |
| |-+-+-+-+-| |
11 | 12 |K|L|?|N|O| 14 | 15
| |-+-+-+-+-| |
| |P|Q|R|S|T| |
| |-+-+-+-+-| |
| |U|V|W|X|Y| |
-----+-----+---------+-----+-----
| | | |
16 | 17 | 18 | 19 | 20
| | | |
-----+-----+---------+-----+-----
| | | |
21 | 22 | 23 | 24 | 25
| | | |
Tile 19 has four adjacent tiles: 14, 18, 20, and 24.
Tile G has four adjacent tiles: B, F, H, and L.
Tile D has four adjacent tiles: 8, C, E, and I.
Tile E has four adjacent tiles: 8, D, 14, and J.
Tile 14 has eight adjacent tiles: 9, E, J, O, T, Y, 15, and 19.
Tile N has eight adjacent tiles: I, O, S, and five tiles within the sub-grid marked ?.
The rules about bugs living and dying are the same as before.
For example, consider the same initial state as above:
....#
#..#.
#.?##
..#..
#....
The center tile is drawn as ? to indicate the next recursive grid. Call this level 0; the grid within this one is level 1, and the grid that contains this one is level -1. Then, after ten minutes, the grid at each level would look like this:
Depth -5:
..#..
.#.#.
..?.#
.#.#.
..#..
Depth -4:
...#.
...##
..?..
...##
...#.
Depth -3:
#.#..
.#...
..?..
.#...
#.#..
Depth -2:
.#.##
....#
..?.#
...##
.###.
Depth -1:
#..##
...##
..?..
...#.
.####
Depth 0:
.#...
.#.##
.#?..
.....
.....
Depth 1:
.##..
#..##
..?.#
##.##
#####
Depth 2:
###..
##.#.
#.?..
.#.##
#.#..
Depth 3:
..###
.....
#.?..
#....
#...#
Depth 4:
.###.
#..#.
#.?..
##.#.
.....
Depth 5:
####.
#..#.
#.?#.
####.
.....
In this example, after 10 minutes, a total of 99 bugs are present.
Starting with your scan, how many bugs are present after 200 minutes?
Your puzzle answer was 1967.
Both parts of this puzzle are complete! They provide two gold stars: **
2019/day25/input.txt
-1
View File
File diff suppressed because one or more lines are too long
2019/day25/prompt.txt
-39
View File
@@ -1,39 +0,0 @@
--- Day 25: Cryostasis ---
As you approach Santa's ship, your sensors report two important details:
First, that you might be too late: the internal temperature is -40 degrees.
Second, that one faint life signature is somewhere on the ship.
The airlock door is locked with a code; your best option is to send in a small droid to investigate the situation. You attach your ship to Santa's, break a small hole in the hull, and let the droid run in before you seal it up again. Before your ship starts freezing, you detach your ship and set it to automatically stay within range of Santa's ship.
This droid can follow basic instructions and report on its surroundings; you can communicate with it through an Intcode program (your puzzle input) running on an ASCII-capable computer.
As the droid moves through its environment, it will describe what it encounters. When it says Command?, you can give it a single instruction terminated with a newline (ASCII code 10). Possible instructions are:
Movement via north, south, east, or west.
To take an item the droid sees in the environment, use the command take <name of item>. For example, if the droid reports seeing a red ball, you can pick it up with take red ball.
To drop an item the droid is carrying, use the command drop <name of item>. For example, if the droid is carrying a green ball, you can drop it with drop green ball.
To get a list of all of the items the droid is currently carrying, use the command inv (for "inventory").
Extra spaces or other characters aren't allowed - instructions must be provided precisely.
Santa's ship is a Reindeer-class starship; these ships use pressure-sensitive floors to determine the identity of droids and crew members. The standard configuration for these starships is for all droids to weigh exactly the same amount to make them easier to detect. If you need to get past such a sensor, you might be able to reach the correct weight by carrying items from the environment.
Look around the ship and see if you can find the password for the main airlock.
Your puzzle answer was 2181046280.
--- Part Two ---
As you move through the main airlock, the air inside the ship is already heating up to reasonable levels. Santa explains that he didn't notice you coming because he was just taking a quick nap. The ship wasn't frozen; he just had the thermostat set to "North Pole".
You make your way over to the navigation console. It beeps. "Status: Stranded. Please supply measurements from 49 stars to recalibrate."
"49 stars? But the Elves told me you needed fifty--"
Santa just smiles and nods his head toward the window. There, in the distance, you can see the center of the Solar System: the Sun!
The navigation console beeps again.
If you like, you can .
Both parts of this puzzle are complete! They provide two gold stars: **
2020/day01/input.txt
-200
View File
@@ -1,200 +0,0 @@
1593
1575
1583
1609
1835
2008
1638
1396
1833
1524
1778
1574
1653
1962
1831
1557
1847
1587
1876
1914
1565
1585
1713
35
1862
1885
1735
1497
1989
1871
1923
1917
1719
1797
1222
1493
1939
1139
1260
1622
1625
1683
1742
1996
1579
1703
1692
1920
1536
1965
1936
1947
1800
1556
1633
1530
1612
1764
1810
1845
1750
1854
1973
1512
1856
1568
1634
1630
1602
1555
1681
1844
1544
1909
1690
1851
1785
863
1866
1988
1715
1881
1570
1380
1956
777
1693
1717
1724
1975
790
1484
1822
1922
1963
1741
1809
1896
1837
1980
1244
1832
1834
1643
1775
1818
1503
1802
1957
1174
1826
1649
1941
1571
1930
1629
1502
2002
1700
1880
1723
1803
2007
1543
1872
1993
1740
1919
1688
1067
1680
1580
1558
1772
1694
1480
1257
1796
2001
537
1701
1613
1784
1559
1482
1968
1604
983
1842
1817
1850
1788
1982
1535
1615
453
1895
1443
1308
1533
1714
1765
1037
1992
1843
1883
1981
1525
1038
1540
1766
1886
1546
1716
810
1899
1708
1508
1870
1051
1867
1840
1617
1726
1566
1616
1948
1771
1627
1994
1486
1913
1600
1983
1501
2003
1667
1620
1943
1674
2020/day02/input.txt
-1000
View File
File diff suppressed because it is too large Load Diff
2020/day03/input.txt
-323
View File
@@ -1,323 +0,0 @@
.#.......#...........#.........
..##.......#.#.#.....##...#....
.......#..#.....#...#..........
...#..........###...#........##
#.#..#.#.##.#........#.#.....#.
#..#....#..#....#..............
#..#........#..................
..#.#...#.#...#....#.#.#..#....
..............#..#.............
.##....#...................#...
........#..........#......#...#
.##..#..#...##..........#...#..
.#...#....#.........#...#.....#
.#........##............#.#....
...........#..............##...
.#..#......#..#..............#.
..#.#.#...........#........#...
..###..........#....#.#......#.
.......#...##..........#.......
........#...#..................
....#....#..#.......#........#.
.......##.#......#.....#...##..
..#.#........................#.
.#.....#.##..............#.#...
..#.#...#.#..#....#....#.......
.#....##.....#....#........#...
..#...........#.##....#...#....
..#.##...#....#.#.....##...#...
.......#...####...#...#.......#
.#...#.........................
.......................#.......
.....#.#.........#..........#.#
#.........#............###..#..
.....#.#.............###.......
...#..#........#.#.......#.....
...................#....#......
...#..#...#............#..##...
...#.....#....#.......##......#
.....#....#...##..#..#...#...#.
..........#...........#.#.#....
..#.......#...#.....#......#...
.........#.......##......#..#.#
..#.....#..#.###...#.#......#..
#....#...#..#...#.....#........
..#......#..#.......#.#.....#..
#......#...#......#.....##.#...
........##.......#.......#.....
.#.#...............#...........
..............#...#.#....#.....
....#......#.#..#......#.......
...##....#....#...#............
.#...............#...........#.
.#.#...#.#.....#.....#...#.#...
...##...........#.....#..#...#.
.#.#...##.#.#......#......#....
.##.....#.......##....#.#.#....
.......#...........#....#....#.
....#...........#......#.####..
......#....#...#...##.......#..
......................#.#####..
..#...#.#...#..#..#......#.....
....#........##.......##....#..
#.#......##.........##.#..#...#
.#.#....#...#..#...#...##....#.
.....##...#....#....#.#........
......#..#....#.#...#..........
.........#...................#.
............#.###....#.#.......
...#.#.....#......#....#.#..#..
..............#..#.#.#.#.......
#..##...................##.....
..#.......#..#.........##..#...
.........##...#......#........#
..#.........#........##.###.#..
...........#.#....#.....###....
..#....##.#..#.##....#.....##..
..#.....#.##..................#
#....#.........................
..............#..#...#.#.......
......#..#.#.##....#..........#
..#.........#.####.....#.......
......#..#.#..........#...#....
......#.................#..#.#.
.....#..........#..............
....#.....#............#....##.
.....#.....#........#..........
............#.....#...#........
........#....#.#...............
#.....#.........#......#..#.#..
...#..#......#......#.......#..
.....#......#.#....#..#...#...#
......................#..##....
.............#.........###....#
#..............#.#..........##.
...#.#.................##......
...........#.#.....#...........
.........#.................#.#.
........#........#...#..##...#.
........#......##.......###....
..............#.#.#............
.#.....###...##.#......#.....#.
.............#......#.#.#...#.#
..#.........#.......#.....#....
......#........#...##......#...
.##..........##......#.#.....#.
..#.##....#....#...............
......#...#..#.....#.....#...#.
.......##..##..#............##.
..............#...##........#..
#....#................#..#.....
........#.......#.#.#...#......
......#.......#..............#.
#.#..#...#........#....#..####.
..#........#...........#.....#.
.##...........................#
.............#...........#.....
.#.....#.#...#.........#.......
..........#...#....#....#......
.#..#........##....#...........
.......###......##...#.........
..........#.#.#..#.#....#......
........##..#.........#....#...
........#.#......#.#...#.#..#..
....#....................#.##..
##....#..#...........#.....#.#.
...#..............##...##..#.#.
......#.##.#.......#..#...#....
....#..#..##.....#.....#.#....#
.......#....##.##..............
#..##....#.....#.#.............
..................#......#..#..
..#......#...#..#.......#...#..
...........#....#.#.....#......
#..#...##.........###..#......#
.......#......................#
#.......#....................#.
..#..#..........#..#..#....#...
.##..#..#.....#.#..##..........
#..###.......#..##..#...#..#.#.
.....##......###.....#.#.##...#
..............#...#....#.#.....
#...........#..................
..............#....#..##..#..#.
.........#.............#.......
.#.#....#....#...............##
.##.##.#.....###.....#.........
....#..............##......#...
....#........##................
....#.....#....#....##....##...
.#........#......#......#......
....#..........#...............
##..........#......#.....#.....
........#.#..#.#..#.....##.....
..##......#.#.......#.#..#.....
.#.......#......#...........#..
..#.#..#.#..................#..
...#...#...#...##......#.......
.#...##....#...#...#...#.......
.......#.#.......#.............
.#.##.#.....#...........#.##.#.
.#.##.#........#...##..........
.#.....#.....#....#..#.........
...##.............##...........
.#........##.....#.......#...#.
...........#..#..##........##..
.....#..#......................
..#.......#....................
.....#......#....#....#.......#
........#..#.#.....#......#....
..........#..#.....#......#....
..........#####.....#........#.
........#..#...#.#....#......#.
.........#...#....#.#..........
......#....##..........#...#...
#..............###.#.#.........
.#.#............##......#.#..#.
......#........................
...#..#......#.......#....#...#
.......#....##.....#.#......##.
...........#..........#..#.....
...........#..#.....###......#.
.......#....#..##......#.......
.........#.#.#.......#..#...#..
.......#.......##.....##...#...
..............#....#.....#.....
...#....#.....#.#..........##..
###.........#.............#....
...##......#.#........#....#..#
#....###.......#...#.#......##.
....#...##.......#......#.....#
.....#......#..................
#........##....#....#.#........
........#.......###...#........
........#..#.......###.........
..............#......#..#......
#......#.....#....#.#..........
.#......##.#.#.....#...#.#....#
.##...........#..#.##.....#....
.....#.....................#...
.#..#...#...##.#...#...........
.......#.......##..#.#..#......
.......##.....#.....#..........
.................#.............
#........#..#.......##.........
#...#..###.#..#....#.#.###.....
..#.......#.......#.......#....
..............#............##..
.#...#..#...##.........#....#..
#...........#...#..............
.......#.....#......#..#.....#.
..........#......#.............
##.........###..##.#....#..#.#.
..............###..............
#..##.............##.....#.....
....##...................#..#..
....#.....#..............#..#.#
........#........##...#.....##.
#...........#.##..........##...
#......##.....#...............#
..##..#....#.................#.
#.......##.....................
...............#.##..##......#.
..#.##..#.#....#.......##......
......##....#............##....
.#..#..##.....#.##....#........
#.........#..........#...#....#
...#.......#.............#.#.#.
..##............#...##........#
.......#.#.#........#..........
.....#.............#.....#.....
.........#.........#.........#.
#.....#....#.......#...........
.........#....#.............#.#
.##..#.......#...#......#......
....#....#....#........#....#..
............#.......#..#......#
.#............#.##........##...
..#...##...#....#...#.#...#..#.
#...#..........#..##.........#.
..#.........................#.#
...........#.........#..#.##...
.#..................#..#.......
......#......#...........#..#..
...##.....#.....#..#.......#...
.........#.#.......#......#....
...........#................#..
.....#...#..#............##....
.#.......#..#....#..........#..
#.....#..#.....#..##.......##..
...#.......#...#....#...#.#..##
...#...##......#....#....#.....
.......###.#..#.......#......#.
........#.#...#..#..#...#....#.
....#.........##.#.....#.......
....#.........#..##........#...
..#...........#......#....#.##.
.....................#.........
...................##......#..#
......#.#.....##..##..........#
..#.##........#.#.#..........#.
.#.......#...##.#....#....#....
#.#......#..#..#.......#.......
.............#........#.......#
....#...#.....#........#...#...
..#..............##..#.........
..#.................#..#...##..
....#..#...#...................
......#.........##.#..#..#...##
........#..#....#.......#.#.##.
.#...#...........#..........#..
##.....#...#............##...#.
.##.....#...#..................
.#.......####.#..##.##.#......#
.............#...#..#..#.......
...#.##.........#.#....#.......
...........##...##....#....##..
........#......#...#...........
...........#..#...#....#.##....
..##....#..........#....#...#..
#....#.#.#.......#.#...........
......#............##..........
#.#.###..#....#.......#...#....
.#......##..#..#.#.........#..#
..#.........#........#....#....
......##.#.......##....#..#..##
.............#...#............#
......#......#...#.#.#.##.#....
#.#...#.##.....#..............#
..........#.............##.##..
#......#....#...#.#.#.#..#....#
........#........#...#.#......#
.....#...........#.............
...........#....#..........#...
....####...#..##....#.#........
.#......#...#..#...........#...
#......###..#.##.###...........
..#...........#.........#....#.
................#.#....#..#.##.
...................#......#....
....#.#.....#.......#...###.##.
.#........#.#....#...#..#...#..
....#..###.................#..#
.....#.#..#........#......#..#.
....#.....#...............#...#
............##.#.........#..#..
.......#..#..##.#.#...##.......
..#..........##..#..#........#.
..............#..#...#.........
......#.#....#........##.......
.#.....##....#..#...#.......##.
..............#.##.............
#..#..#...##....##.#.....##.#..
..#...###..#.........##........
........##......#.....#..###...
.....#......##.###.............
....#.....#.#..#.#..#..........
....#..#.......#...........#...
.#.............#..#......##....
..#.#......#.#.................
.......#.#.#............#..#...
......###....##............#..#
.........#....#......#.........
..........#...............#..#.
2020/day04/input.txt
-1129
View File
File diff suppressed because it is too large Load Diff
2020/day05/input.txt
-809
View File
@@ -1,809 +0,0 @@
BFBFBBBRLL
BFFBBBBRRR
FFBBFBFLLL
FFBBBBBRLR
BFFBFBFRRL
BFFBFFBRLL
FBBFBFBRLL
FFBFFBBLLR
BFBBBFFRRR
FBFFFFBLLL
FFFFFFBRRR
FBBFBFFRRR
FFBBBBFRLL
BFFBBFBLRR
BFFFFBFRRL
FFFFFBFRLL
FBFFBFFRRR
BFBFBBBLLR
FBFFBBBLRR
FBBBBBFRLR
FFBFFBBRLR
FBBFFFFRRL
FFFFFBBRRL
FFBBFBFRLL
BFFBBBBLLL
FFFFBFFRRL
FBBFFFFLLR
FFBBBBBLLR
FBFBBFBRRR
FBFFBBFRRL
BFBFBFBRLL
BFFBBBBLLR
FBBBBFFLLR
FFBFBBFRLL
BBFFFFBRRL
FBFFFBBLLL
FFFFBBBLLR
FFBBFFFRLL
BFBFFBBRLL
FFBBBFBLLR
FFBBFFFRRR
BFFFBBBRLL
FBFBBFFRLR
FBBFBBBRRR
FBBBBBBRRR
BFFBFFFRRR
BFFBBBFLLL
BFBFFFBLLL
BFFBFBFLLR
FBFFFFBLRL
BFFBBFFLRR
BFBFBFFLLL
BBFFFBFLRL
BFFFBBBLLL
FFBBBBBLLL
BFFFFFFRLL
FFBBBBBLRL
FBFBBBBLLR
FFBBFBBLRL
FBBFBFBLRL
FBBFBBBLRR
BFFBFBBRRR
BFFBBFFLRL
FBFBBFFLLR
BFBBBFFLRR
FBBBFFBLRL
FBFBBBBRLL
FFFFBFFLLL
BBFFFBFRRR
BFBFBBFLRR
FBBFBFFLLL
FBBBBFBRRR
FFFFBBFRRR
FBBFFBFLLL
FBBBFFBRRR
BFFBBBBLRL
FFFFBFBRLL
FBBFFFBRRR
FBFBBFFRLL
BFFFFBFRRR
FFBBBFFLRR
FBBFBBFLLR
BBFFFFBRRR
BFFBFBFLLL
FFFBBBFLLR
FFBFFBFLRL
FFBFBBBLRL
FBFFFBBRRL
BFFBFBBLLR
BFBBFBBRLR
BFBBFFFRRL
FBFBFFFLLR
FFBBBFFLLR
BFBBBFFLLR
BFBFBFBLLR
BBFFFBFLLL
FFBBFBFRRR
BFFFBBFRRR
FBFFBBFRLR
BFBBBBFRLL
BBFFFFBLLR
FFFBFBBLLR
FBFFBFBRRR
FFBFBFBRRR
FFFFFBBRLL
BFFFFBFLLR
FBBFBBFLRR
FBFFFFFRRL
FBBFBFBLLR
BFFFFBBLLL
FBBBBBFLLL
FBBFFBFRRR
BBFFBFBLRL
BFFFBFFRRL
BFFFFFBLLR
FFFBBFBRLR
FBFFBFFRLR
BFBFBFFLLR
BFFFBBFLRL
FFFFBFFLLR
BFFBFFFRLR
FBFBFBFLRR
FBBBBBBRLR
BFBFBFFLRL
BFFFBFBLLR
BBFFBFFLLR
BFFBBBBLRR
FFFBBFFRRR
FBBFBBBLRL
FFBBBFBRLR
FBBBFBFRLR
FBBBBFFLRL
FFBFBFFRLR
BBFFFFFLRL
FFFBBBBLRL
FBFBBBFLRL
BFFBFFFRRL
FFBFFBFRLR
FBFBFFFLRR
FBFBFFBRRL
FBFBBBBLRL
BFBBBBBLLL
BBFFFFBLRR
BFFFBFFLRR
FBBBBBFRRR
FBFFBBBLRL
BBFFFBBRLL
BFBFBFBRRR
BFFBFBBLRR
FFBBFBBRLL
FFFFFBBRLR
BFFFBFBRRL
FFFBFBBLLL
FFFFBFBRRR
FBBFFBBLRR
BFFFFBBLRR
FFBFFFBLRL
FFBFBFBLRR
FBBBBFFRRR
FBFFBFBLRL
BFBFFBBLLL
FBBFFFFLLL
FBBFFBBLLR
FFBFBFFRLL
FBFBBBFRRR
BFFFBFFRLL
FFBFBFBRLL
FFBBFBFLRL
FFBBFBBLLR
FBFBBFBLRL
BBFFFFFRRR
FBBFFBBLRL
BFBFFBBLLR
FFFFFBBLLL
FFBBBBFRRL
FFBBFFFLLL
FFFBFFBRLL
FFBFBBFLLR
BFFFBBBRLR
FBFFBBFRRR
FBBFFFFRLL
FFFBBBFRLR
FFBBFFBRRR
BFBFFFFLRR
BBFFBBFLLR
BFFBFFBLRL
BBFFBFFLRR
FFFBFFBRRR
BFFFBBBLRR
BFBFFBFRLR
FFFBFFFRRR
FFBFBBBRLR
BFBFBBFRLR
BBFFBFFRRL
BFBFBFFRLR
FBBFFFFRLR
FBFBFBBRLL
FFBBBFBRLL
FFBFFFFRRR
BFFBFBBLRL
FFFBFBFRLR
FBBFFFBLRL
FFBFFFFLRL
BBFFBBFRLL
FFFFFFBRRL
BFFBFFBLRR
BFFFFFFRRL
BFFBBFBLRL
FBBFFFFLRL
FFFBBFFRLR
BFBBFFFRLR
FFBBFBBLRR
FFBFBBBLLR
FFBBBBFLRR
FFBFBFFLLL
FFFBFFFLLL
FFBFBFFLRL
BFBFFFBLRL
FBFFFFFLRR
BFBBBBFRRR
FBBFBBFLLL
FFFBBFFLLR
FFBFBBBLLL
BBFFBFFLLL
FBFFBFBRLR
BFBBBBFLRR
FBBBFBFRRL
BFFBBBBRRL
BFBBFFFLLL
BFBBFBFRRR
BFFBFBBLLL
FBBBBBFRRL
FFFBFBFRRL
FFBBBBFLLL
FBBFBBBLLL
FBFFBFFLLR
BFBBBBBLRR
FBFFFFFLLL
BFFFBBBRRL
FBFFFBBRLL
BFBBFBBLRR
FBBBFBBRLR
BBFFBFBLLR
BBFFFFBRLL
BFBBFBFLLR
FBBFFBFLRL
BBFFFBFRRL
BFFFBBBLRL
FBBBBFBRRL
BFBFBFBRRL
FFBFFBBRRR
FBBFFBBLLL
BFFBFFFRLL
FFFFBFFRLR
FFBFFBBRLL
FBBBFFFLRL
FFBFBFBRRL
BFBBBFFLLL
FBBBBFBLLL
FFFBBBBLRR
FBFFFFBRLR
FFBBBBFLRL
BFBBBBFRRL
FFFFBBFLLL
BFFFBBBLLR
FFFBBBBRRL
FBBBFBFLLL
BFFFFFBLRL
FFFBFBBRRL
BFFBBFBRLL
FBFBBFBLRR
FBBBFFFLLL
BFBFFFFRRL
FBBBBFFRLL
BFBFFBBLRL
FBBBBFBRLL
FBBFFBBRLR
FFBBBFBRRL
FFFBBFFLRL
BFBBFBFRLL
FBBFBBFRLL
FBFBBBFLLR
FBFFBFBRLL
BFFFBFFRRR
BFBFBBFLRL
FBBBBBFLRR
FFFFBBFRRL
BFBBFFBRRR
FBBFFFBLRR
BFBBBFBLLR
FBBBBFBRLR
BFBFFFFRLL
FFFBBBFLLL
BFFFBFFLLL
FBFBFFBRLL
BBFFFFFLLL
FFFFFBBLRR
BFFFFFFLRR
BFFBFBFLRR
FFFBFFBLLR
BFFFFFFLLR
FBFFBBBRRR
FFFFBFBLLR
BFFBBFFLLL
FFFFFBBLLR
BFBBBFBRRL
FBFFBBBRLR
BBFFFFBLRL
FFBFFBFLLL
FBFFFFBLRR
FFFBFBFLLR
FFBFFFFLLR
FFFFFBFLRL
BBFFFBBLLL
BFFBFBFRRR
FBBBFFFLLR
BFBBBFBLLL
FBFFFFFRRR
FBFFBBFLRL
BFFBBFBLLR
FBBFFBFRLR
FFFFFBFRRL
FFBFFBBLLL
BFBFFBFRLL
BFBBFFFRLL
FBBBFBFRLL
FBFBFFFLLL
BBFFFBBLRR
FFFBFBFLLL
BBFFBFBLRR
FFBBFBFLRR
BFFBBFFRLR
FBFBFBBRLR
FBBFFBBRRR
FFBFFFBRRR
BFBBFBBLRL
FFFBFFFRLL
BFBBFBFLRL
BFBFBBBLLL
FBFBBFFLRL
FFBFBBBRRL
FFFBFFBRRL
FFBFFFFRLR
FFFFBBBRRR
FFFFBFBLLL
FFBFFBFRRR
FFBFFBFLRR
FFFBBFFRLL
FBBBFFFRLR
FFBFFFBRLL
FBBBFBFRRR
FBFFFBFLRR
FBBBFBFLRL
FBFBFFFRRL
BFBFFFFLRL
FFBBFFBLRL
BBFFBFBLLL
FBFBBBBRRR
FBBFFFBLLR
FBBFBFFRRL
FFBFBFBLLR
BFFBBBFLRR
FBFBFFBLRL
FBFFBBBLLL
FFBFBBFRRL
BFFBFFFLLR
FBBBFBBLRL
BFFBBFBRLR
BFFFBFBRLL
BFFFFBBRRR
FBFFBBFLLR
FFBFFFBRRL
FFBBBBBRRL
BFFBBBBRLR
BFFFBFBRLR
FBBBBBBLLL
BFFFBFBRRR
FFBBBFFRLR
FBBBFBFLLR
FBFBFBFRRR
FBFBBBBLLL
BFBFBFBRLR
FFFFBFFLRR
BFFBFBBRLL
BFBFFFBLLR
BFBBFBBLLL
FBFFBBBLLR
FBBFBBFRRR
FFFBFFFLLR
FFFBFBBRLL
BFBFFBFLLR
BFFFFBBLRL
FBFBBFBLLL
FBBFFBFRLL
BFBBBBFRLR
BFBFFFBRLL
BBFFFBFRLR
FFFFBBBLRL
BFBBFFBLRL
BBFFBBFRRL
FFBBBFBLLL
FBFBFBFLRL
FBBBBBBRRL
FFFFFBBRRR
FFFFFBFRRR
FBFFFBBRRR
BFFBBFBRRL
BBFFFFFRLL
FFFBFFBRLR
FFBBFFFRRL
FBFBFFFRLR
BFFBBBFRLR
BFBBBBFLRL
FBFFBFBRRL
FFBFBBBRRR
FFFFBBFRLL
FFFFBBBRLL
FBBFFFBLLL
BFBBFBBRRR
BFFBBBFRLL
BFFFBFFRLR
FBFBFFBLLL
BFFFFBBRLL
BBFFBFFLRL
BFBBBBBLRL
BFFFFBBRRL
BFFBFFFLRL
BBFFBBFRLR
BFBBFBFLLL
BBFFBFFRLR
FBBFBBBRLL
FFFBFBFLRR
BFBFFBFLLL
FFFFBBFLRR
FFFBBBBLLL
BFBFFFFRRR
FBFBBBFRLL
FFBBFFFLRR
FBFBBBFRLR
BFFFBBFLLR
BFBBBBBLLR
BFFBFFBRRR
FBBBFFBRLR
BFBFBBFLLL
FBFFFFFRLR
BFFFFFFLLL
BFFBFFBRLR
BBFFFFBRLR
BBFFBFBRLR
FBFBFBBLRR
BFFFBBFLRR
FBFFBBBRLL
FFFFBBFLRL
FFBFFBBLRL
FBFFBBFLLL
FBFBBFFLLL
FFBBFFBRLR
BFFFBBBRRR
BBFFFBBLLR
BFFBBBFLRL
BBFFFBBRLR
FBBBBBBLLR
FBFBBFFRRR
FBFFBBFRLL
FFFBBFBRLL
FFFBFBBRLR
FBFFBFFLLL
FFBBBBBLRR
FBFFFFFLLR
FBFFFBBLRL
FBFFBFBLRR
FFBBBBFRRR
FBBBFFFRRL
FFFFBBFLLR
FFFFFBFLRR
BBFFBBFLLL
FBFBFBBLLL
FBFBFFBRRR
FBFFBFFLRR
FBBFFFFLRR
FBBFBFFLLR
BFFBBBFRRR
FFBBBBBRRR
BFFFFFBRLR
BFFBFBFRLR
FFFFBFFRLL
BFBFFBBRLR
BFBBFFFLRL
FBFFFFBLLR
FFBFFBFRLL
BBFFFBBLRL
FBBFFBFLRR
BFFFFBBRLR
BFBBFBBRRL
FBBFBFBRRR
BFFFBFFLRL
FFBBFBBRRL
FFFBFFBLRR
FBBFBFBRRL
BFBFBBFLLR
BBFFFBBRRL
FFBFBBFLRL
FFBFFFBLRR
FBFFBFBLLR
BFBFFBBRRL
BFFBFFFLRR
BFBBBFBRRR
FFBFBBBLRR
BFFFFFBRRL
BFBFBFFRRL
FFBFFBBRRL
FBBBBFBLRL
BFBFFFFRLR
FBBBFFFRRR
BBFFBBFLRR
FFBFBFBRLR
FBBBFBBLRR
FFBFBBBRLL
BFFBBFFRRL
BBFFBFBRLL
FBBBFBBRRR
FBFFFFFLRL
FFBBFFBLLR
FBBFBBBRRL
FFFFBBBRLR
FBBFBBBRLR
FBBBBFBLLR
FFBFBFBLLL
BFFFBBFRRL
FBFFFBFRRL
BFBFBBBRRR
FBFBFBBLRL
BFBFBFFRRR
FFBBBBBRLL
FFFBBBFRRL
FFBBFFBLRR
BFBBBFBLRR
FBBBBBBLRR
FBFFFBBLLR
FBBFBFFLRL
FFBBBFFLRL
FFBFFBFLLR
FFFBBFFRRL
FFFFBFBRRL
FBFBBFBRRL
BFBBFFBLLL
BFFBFBBRRL
FFFFBBBRRL
BBFFFFFRRL
BFFBFFBRRL
FFFBBBFRLL
FFBFBBFRLR
BBFFFBFRLL
BFBBFBBRLL
FFFBFBBRRR
FBBFFFBRRL
FBFBFBFRLL
FBBFFFFRRR
BFBFFBFRRL
FBBBFBFLRR
FFBFBFBLRL
FFBBBBFLLR
FFFFFBFLLR
FFBFFFBLLL
BBFFBFFRLL
FFFBBBBRRR
FFBFFBBLRR
BFFFFFFLRL
FFFBBBFLRL
FBFFFBFLLR
BBFFFBFLRR
BFBFFFBRLR
BFFFBBFRLR
BFBFBBFRRL
BFBFFBBRRR
FFBFBBFLLL
FFFBBFBLLL
FFBBFFBRRL
FBFBBBFLLL
BFFFFFFRLR
BBFFFBFLLR
FBBFBFFRLL
FBFBFFBLRR
FBBFBFBRLR
FBFFBBBRRL
BFFBBFFRLL
BFFBFFBLLL
BFBBFBFRRL
FFFBFBFLRL
FFBBFBBRLR
FBBBBBFLRL
BBFFBFBRRL
FFFFBFBLRR
FFBFBFFRRL
FBFBBBBLRR
FFFFBFFRRR
BBFFBBFLRL
BFBBBBFLLL
FBBFBFBLRR
FBBBBBBRLL
FFFBBBBRLR
BBFFFFFRLR
FBFFFFFRLL
BFBBFFBLLR
BFFFFBFRLR
FFBBBFFRRL
FFBBBFFRLL
BFFBBFBLLL
FFFBBBFRRR
BFFFFFBRRR
FBFFFBFRLL
FBBFBFFLRR
BFFFFFBLRR
BFBFBFBLRL
BFBBBFFLRL
FFBFFFFRLL
FBFBFBFRLR
BFFFBBFRLL
FFBBFBFRLR
FBFBBFBLLR
FBFFBFFRRL
FBBBBFFLRR
BFBFBBBRLR
BFBBBFFRRL
FFFBFBBLRL
FBBBFFBLRR
BFBFFBFLRL
BFFFFFBRLL
BFFFBFFLLR
BFBBBFBRLR
FFFBFFFLRR
FBFBFBFRRL
FBFBFFFLRL
FBBFBBBLLR
BFBFFFFLLR
FBFFFBFLLL
FBBFBBFRLR
FBBFFFBRLL
FFFBFFBLRL
FBFBBFBRLR
BFBBFFFRRR
BFBFBFFRLL
FBFBFBBRRL
FFFBFBFRLL
FBBFFBBRLL
BFFBFBFLRL
BFFFFBBLLR
BFFFFFFRRR
BFBBBFBLRL
FFFBBFFLLL
FBBBFBBRLL
FFFBFFBLLL
FBFFFBFRRR
BFBFFBFLRR
FFBFFFFLRR
BFBBBFFRLR
FBFBFFBLLR
FFBFBBFRRR
FFBBFFBLLL
FFBFFFFLLL
BFFBBFBRRR
FFFBBBFLRR
FFBBFFBRLL
FFBBFBBLLL
BFFFFBFLLL
FFFBBFBRRR
FFBFFFFRRL
FFFBBFBRRL
BFFBBBFRRL
FBBBFFBRLL
FBFBFBBLLR
FBBBFBBRRL
BFBFBBBRRL
BFBFBFFLRR
BFFFFFBLLL
BFBFBBFRLL
FBBBBBFRLL
BFFFBFBLRL
FBFBBBBRLR
FBFFFBFLRL
FFBFBFFRRR
BFBFBFBLLL
BFBBFFBRLL
FBBBBBBLRL
BFFFBBFLLL
FBBFBBFLRL
FFFFBBFRLR
BFBFFFBRRR
FFBFBFFLRR
FFFFFBFLLL
FBFBFFFRRR
FBFFFBFRLR
FBFBBFBRLL
BFBFFBFRRR
BFBBFFBRLR
FBBBBFFRRL
BFBFFFFLLL
BFBFFFBLRR
FBFBBBBRRL
BFFFBFBLRR
FFBBFBFLLR
FBBBFFBRRL
FFFFFBFRLR
FFFBBFBLLR
FBFFBFFLRL
FFFBFBFRRR
BBFFBFBRRR
BFBBBBFLLR
BFBBBBBRLR
FFBBFFFLRL
FBBBFFBLLR
BFBFBFBLRR
FFBFBFFLLR
FBFFBFFRLL
FFBFFFBLLR
BFBBFBFRLR
FBBBFBBLLL
BFBBBBBRLL
FBFBFFBRLR
FFBBBFBLRR
FBBFFBFLLR
FFFBBFBLRL
FBFBBBFLRR
FBBBFFFLRR
FBFFFFBRRR
FFFFFBBLRL
FFBBBBFRLR
BFFBFBFRLL
BFFFFBFRLL
BFFFBFBLLL
BFBBBFBRLL
FFFBFFFRLR
FBBBFFBLLL
FBFBBFFLRR
FFFBFBBLRR
BFBFFFBRRL
FFBBBFFRRR
FBFFFFBRLL
FFFBBFBLRR
FFFFFFBRLR
FFFBBBBLLR
FFFBFFFRRL
FBBFFBBRRL
FBBBBFBLRR
FBFFBFBLLL
FFBFFFBRLR
BFFBBBFLLR
FFFBBBBRLL
FFFFBBBLRR
FFFBBFFLRR
BBFFFFFLLR
FFFFBFBLRL
BFBFBBBLRR
FBBFFFBRLR
FBFFFBBRLR
FBFFBBFLRR
BFBBFBFLRR
FBFBFFFRLL
BBFFBFFRRR
BFFBBBBRLL
BFBBFFBRRL
BFFBBFFLLR
BFBFBBFRRR
FBFBFBFLLL
FBBBFFFRLL
FFBBFBBRRR
FFBBBFFLLL
BFFBFFFLLL
BFBFFBBLRR
FFFFBFBRLR
FBFBBBFRRL
FFFFBBBLLL
FBBBBBFLLR
BFBFBBBLRL
BBFFFFFLRR
BFFBFFBLLR
BFBBFFBLRR
FBBBFBBLLR
FFBFBBFLRR
FBFBFBFLLR
FBFBFBBRRR
BFFFFBFLRL
FFFBFFFLRL
BBFFFBBRRR
BFBBFFFLRR
FFFFBFFLRL
BFFBBFFRRR
BFFBFBBRLR
FFBBBFBRRR
FFBBFBFRRL
FBBFFBFRRL
FBBFBBFRRL
FBBFBFBLLL
BFBBBBBRRL
FFBBFFFLLR
FFBBBFBLRL
FFBBFFFRLR
BFBBFBBLLR
FFBFFBFRRL
FBBBBFFLLL
BFFFFBFLRR
BFBBBFFRLL
BFBBBBBRRR
BBFFFFBLLL
FBFFFBBLRR
FBBBBFFRLR
FBBFBFFRLR
FBFBBFFRRL
FBFFFFBRRL
2020/day06/input.txt
-2147
View File
File diff suppressed because it is too large Load Diff
2020/day07/input.txt
-594
View File
@@ -1,594 +0,0 @@
vibrant purple bags contain 3 shiny lavender bags, 1 mirrored gray bag, 4 muted bronze bags.
posh crimson bags contain 4 drab plum bags, 5 dotted purple bags, 3 vibrant lavender bags, 2 striped plum bags.
pale cyan bags contain 5 drab violet bags, 2 dotted crimson bags.
dim lime bags contain 1 muted purple bag, 2 striped silver bags.
clear aqua bags contain 2 plaid green bags.
bright teal bags contain 4 shiny crimson bags, 3 faded red bags, 2 posh lavender bags.
clear white bags contain 1 pale olive bag, 2 vibrant plum bags, 4 clear cyan bags.
dull plum bags contain 1 bright yellow bag, 5 bright tomato bags.
dark crimson bags contain 3 dotted gray bags.
shiny green bags contain 4 pale violet bags, 3 muted teal bags.
clear salmon bags contain 1 light yellow bag.
dull salmon bags contain 1 dim lavender bag, 3 faded teal bags, 4 dotted beige bags, 1 faded red bag.
pale black bags contain 4 drab maroon bags, 4 dotted orange bags, 1 shiny black bag, 4 mirrored yellow bags.
vibrant olive bags contain 5 clear chartreuse bags, 4 clear blue bags, 4 mirrored orange bags, 1 posh tomato bag.
shiny blue bags contain 3 light green bags, 5 dark chartreuse bags.
dark teal bags contain 1 posh maroon bag.
vibrant brown bags contain no other bags.
striped crimson bags contain 2 shiny gold bags, 4 pale indigo bags, 4 light maroon bags.
bright fuchsia bags contain 1 posh purple bag, 4 clear gold bags, 5 dark teal bags, 2 plaid orange bags.
bright black bags contain 1 bright teal bag, 4 dull olive bags, 5 posh turquoise bags, 3 dotted teal bags.
striped beige bags contain 3 dark indigo bags, 1 drab aqua bag.
dim crimson bags contain 5 striped turquoise bags, 4 faded brown bags.
vibrant black bags contain 2 mirrored gray bags, 5 light maroon bags, 5 pale plum bags, 3 mirrored black bags.
muted chartreuse bags contain 4 dim indigo bags.
dotted bronze bags contain 3 clear aqua bags, 2 bright tan bags, 4 muted brown bags, 1 bright maroon bag.
posh cyan bags contain 1 vibrant black bag, 3 vibrant coral bags.
mirrored brown bags contain 5 pale gray bags, 4 dim beige bags.
vibrant indigo bags contain 5 mirrored maroon bags, 3 drab purple bags.
clear maroon bags contain 5 dotted teal bags, 4 wavy black bags.
faded silver bags contain 2 plaid red bags, 1 posh green bag, 3 vibrant magenta bags, 2 bright magenta bags.
light coral bags contain 5 dull turquoise bags.
wavy beige bags contain 2 shiny yellow bags, 1 shiny lavender bag, 3 plaid bronze bags.
faded fuchsia bags contain 5 light maroon bags, 2 mirrored cyan bags, 3 light aqua bags.
dark fuchsia bags contain 2 dotted blue bags, 5 muted olive bags, 5 posh coral bags, 4 clear salmon bags.
vibrant white bags contain 1 dim lavender bag.
bright plum bags contain 2 shiny tan bags.
wavy green bags contain 1 light beige bag, 5 mirrored blue bags, 1 pale turquoise bag.
posh magenta bags contain 4 dim violet bags, 3 clear aqua bags.
plaid coral bags contain 3 wavy salmon bags, 2 dark gold bags.
dull orange bags contain 1 dull green bag.
shiny aqua bags contain 1 plaid yellow bag, 3 shiny green bags, 5 vibrant bronze bags, 2 striped olive bags.
dotted teal bags contain 1 light gray bag, 1 dotted beige bag, 3 shiny gold bags, 3 faded tan bags.
dotted red bags contain 3 mirrored gray bags, 1 mirrored lime bag.
muted fuchsia bags contain 4 drab tan bags.
striped tomato bags contain 1 wavy silver bag, 3 bright blue bags, 5 drab silver bags, 5 dim orange bags.
vibrant coral bags contain 5 shiny plum bags, 5 pale aqua bags.
plaid gold bags contain 1 mirrored cyan bag, 2 dull lavender bags.
posh olive bags contain 1 shiny coral bag, 4 clear beige bags, 4 light bronze bags, 2 striped olive bags.
posh teal bags contain 1 drab yellow bag.
bright green bags contain 4 drab purple bags, 5 shiny yellow bags.
pale lavender bags contain 3 drab olive bags, 2 muted beige bags, 4 muted blue bags, 1 dim fuchsia bag.
faded green bags contain 1 dim turquoise bag, 5 drab cyan bags, 2 clear tomato bags, 2 light brown bags.
wavy blue bags contain 2 striped red bags, 5 dark gold bags, 5 clear white bags.
plaid olive bags contain 5 pale aqua bags.
muted purple bags contain 4 bright bronze bags.
vibrant turquoise bags contain 1 dark silver bag, 5 plaid teal bags, 5 posh turquoise bags.
striped chartreuse bags contain 5 muted bronze bags, 2 wavy salmon bags.
drab cyan bags contain 2 posh tomato bags, 1 wavy turquoise bag.
vibrant silver bags contain 3 light violet bags, 4 vibrant brown bags, 2 light beige bags, 5 dark indigo bags.
faded salmon bags contain 5 dim beige bags, 5 dotted beige bags.
light cyan bags contain 4 plaid beige bags, 5 vibrant black bags, 4 pale chartreuse bags, 4 plaid gray bags.
light aqua bags contain 5 faded red bags.
vibrant lavender bags contain 1 bright black bag, 5 plaid indigo bags.
drab salmon bags contain 1 dotted gray bag, 5 mirrored silver bags, 1 shiny bronze bag, 1 faded bronze bag.
striped coral bags contain 4 light silver bags.
vibrant gray bags contain 5 striped green bags, 2 light turquoise bags.
dark aqua bags contain 3 dark teal bags, 5 clear bronze bags, 5 dotted tan bags.
dark olive bags contain 5 light gold bags, 3 dark green bags.
clear lime bags contain 5 dull red bags, 3 mirrored salmon bags, 1 bright crimson bag, 4 vibrant black bags.
dull gold bags contain 1 dark violet bag, 1 dim chartreuse bag, 1 vibrant lavender bag, 2 clear red bags.
dim black bags contain 5 dull black bags, 3 faded silver bags, 5 pale red bags.
clear yellow bags contain 2 clear beige bags, 2 shiny fuchsia bags, 1 plaid coral bag.
mirrored gold bags contain 5 dotted plum bags.
dotted maroon bags contain 3 dotted purple bags.
dim bronze bags contain 2 wavy magenta bags, 2 drab red bags.
wavy white bags contain 3 dull lime bags, 4 drab tan bags.
vibrant aqua bags contain 1 drab tan bag, 3 light crimson bags.
mirrored cyan bags contain 2 dull olive bags.
faded crimson bags contain 3 bright fuchsia bags, 5 dotted chartreuse bags, 4 striped plum bags.
faded purple bags contain 5 faded lime bags, 3 drab lavender bags.
striped black bags contain 1 vibrant tan bag, 1 drab maroon bag.
striped magenta bags contain 2 drab lavender bags, 2 shiny bronze bags, 2 posh salmon bags.
shiny olive bags contain 1 posh violet bag, 4 dotted orange bags, 1 drab maroon bag, 5 drab lavender bags.
dull tan bags contain 1 wavy violet bag, 2 plaid plum bags, 4 bright lavender bags.
pale indigo bags contain 1 striped chartreuse bag, 4 bright magenta bags, 5 wavy salmon bags.
dotted magenta bags contain 4 posh red bags, 2 light lime bags, 2 dull fuchsia bags.
vibrant blue bags contain 2 drab brown bags, 3 muted orange bags.
clear turquoise bags contain 2 muted crimson bags, 2 drab bronze bags, 4 drab white bags, 1 clear white bag.
drab bronze bags contain 1 faded olive bag, 4 dim indigo bags, 3 pale black bags.
shiny white bags contain 5 pale plum bags, 1 mirrored aqua bag.
striped teal bags contain 1 dull lime bag.
light lavender bags contain 2 mirrored brown bags, 3 bright orange bags.
light magenta bags contain 3 striped silver bags, 1 drab yellow bag, 4 bright orange bags, 5 dotted lavender bags.
mirrored salmon bags contain 2 bright magenta bags, 3 drab aqua bags, 3 shiny gold bags.
muted lavender bags contain 5 wavy chartreuse bags, 1 dark coral bag, 2 plaid gray bags.
muted yellow bags contain 1 dim lavender bag, 5 faded gold bags, 3 clear beige bags.
vibrant maroon bags contain 1 faded salmon bag, 2 vibrant tan bags, 1 posh fuchsia bag, 5 plaid gold bags.
bright lavender bags contain 2 pale gray bags.
plaid salmon bags contain 5 dull fuchsia bags, 4 faded gold bags, 2 dark teal bags, 1 bright teal bag.
dark turquoise bags contain 1 dull fuchsia bag, 3 dull tomato bags, 1 striped cyan bag.
dark indigo bags contain 1 dotted red bag.
light green bags contain 4 vibrant bronze bags, 1 wavy black bag, 1 dark black bag.
drab magenta bags contain 5 mirrored beige bags, 1 faded brown bag.
clear coral bags contain 5 posh green bags, 5 dull yellow bags, 2 dim salmon bags.
light red bags contain 1 light silver bag, 1 mirrored lime bag.
muted beige bags contain 2 drab yellow bags, 4 light maroon bags, 2 shiny yellow bags.
pale blue bags contain 5 mirrored crimson bags, 1 drab salmon bag, 2 posh lime bags.
drab crimson bags contain 2 light salmon bags, 5 pale gray bags, 2 wavy beige bags.
faded maroon bags contain 5 mirrored gold bags.
bright indigo bags contain 5 pale gray bags.
dull teal bags contain 3 faded silver bags, 1 vibrant lime bag, 1 mirrored crimson bag.
shiny salmon bags contain 3 bright magenta bags, 4 dotted blue bags, 1 dotted maroon bag, 3 bright beige bags.
mirrored beige bags contain 1 vibrant magenta bag, 5 light silver bags, 5 shiny lavender bags.
pale tan bags contain 4 striped magenta bags, 1 clear cyan bag, 1 clear beige bag, 1 mirrored purple bag.
drab tan bags contain 5 mirrored maroon bags.
dark yellow bags contain 2 dull olive bags, 4 dull teal bags, 4 light yellow bags, 1 faded fuchsia bag.
drab green bags contain 1 clear magenta bag.
pale turquoise bags contain 2 drab chartreuse bags.
plaid silver bags contain 3 dotted beige bags, 2 plaid orange bags.
vibrant red bags contain 5 muted magenta bags, 4 drab white bags, 1 drab aqua bag.
muted maroon bags contain 2 shiny coral bags.
mirrored purple bags contain 4 mirrored aqua bags.
muted white bags contain 2 plaid green bags, 2 posh green bags, 5 faded gray bags.
bright chartreuse bags contain 2 bright lavender bags, 1 muted tan bag.
vibrant orange bags contain 4 muted bronze bags, 5 vibrant magenta bags.
clear chartreuse bags contain 2 plaid red bags, 2 striped teal bags, 5 dotted fuchsia bags.
clear gray bags contain 1 dull beige bag, 3 light aqua bags.
striped indigo bags contain 2 faded chartreuse bags, 4 dull white bags, 5 mirrored maroon bags, 1 plaid coral bag.
posh green bags contain 1 bright tan bag.
dark salmon bags contain 5 wavy yellow bags.
muted tomato bags contain 3 muted beige bags, 2 faded gray bags, 2 clear gold bags.
posh silver bags contain 2 dotted beige bags, 2 pale fuchsia bags, 1 dark brown bag.
mirrored white bags contain 5 dim white bags, 3 light aqua bags, 2 faded gray bags, 3 shiny gold bags.
drab chartreuse bags contain 5 mirrored plum bags, 2 dim aqua bags, 1 vibrant brown bag, 5 vibrant orange bags.
light blue bags contain 3 dim chartreuse bags, 1 bright green bag, 3 clear chartreuse bags.
posh white bags contain 1 dull brown bag, 3 bright magenta bags.
dotted violet bags contain 3 plaid gray bags, 5 pale white bags, 5 wavy blue bags, 1 mirrored magenta bag.
drab plum bags contain 1 dull salmon bag, 2 muted magenta bags.
plaid violet bags contain 3 bright olive bags.
wavy crimson bags contain 2 bright purple bags, 3 shiny yellow bags, 3 posh bronze bags.
dull yellow bags contain 1 plaid red bag, 1 plaid maroon bag.
dull magenta bags contain 4 dark olive bags, 3 faded olive bags.
faded brown bags contain 4 light yellow bags, 3 drab red bags.
bright crimson bags contain 4 posh lime bags, 1 mirrored gray bag, 5 pale indigo bags.
bright lime bags contain 3 faded violet bags.
dotted white bags contain 2 pale fuchsia bags, 4 light red bags, 3 dull gold bags, 1 wavy salmon bag.
dull cyan bags contain 2 dark indigo bags, 5 muted black bags, 4 wavy aqua bags.
light plum bags contain 4 wavy beige bags, 2 clear crimson bags, 5 striped beige bags.
wavy chartreuse bags contain 1 dark indigo bag.
clear cyan bags contain 1 mirrored lime bag, 4 light silver bags.
striped salmon bags contain 3 dotted silver bags, 1 shiny turquoise bag, 3 mirrored tan bags.
bright cyan bags contain 1 wavy tomato bag, 4 dotted yellow bags, 2 pale tan bags.
muted red bags contain 2 vibrant chartreuse bags, 1 dim indigo bag, 5 muted aqua bags.
mirrored plum bags contain 1 light black bag, 3 vibrant brown bags.
mirrored lime bags contain 5 bright violet bags, 4 light maroon bags, 1 dotted beige bag, 2 plaid maroon bags.
dotted chartreuse bags contain 5 light black bags, 3 shiny turquoise bags, 5 drab lavender bags, 3 shiny silver bags.
plaid brown bags contain 2 drab gold bags, 5 clear cyan bags, 2 drab gray bags, 2 vibrant magenta bags.
clear olive bags contain 5 shiny cyan bags, 1 dark teal bag, 3 striped bronze bags, 2 striped olive bags.
light beige bags contain 5 pale plum bags.
dark cyan bags contain 5 posh tomato bags, 3 clear magenta bags, 2 shiny olive bags.
dark maroon bags contain 1 shiny turquoise bag, 2 dotted brown bags, 3 dark lime bags.
vibrant teal bags contain 2 pale purple bags.
dotted turquoise bags contain 5 vibrant magenta bags, 3 dark chartreuse bags.
dark red bags contain 2 striped chartreuse bags.
pale purple bags contain 4 drab gold bags, 1 drab violet bag, 3 muted black bags.
vibrant fuchsia bags contain 2 shiny purple bags.
dotted gold bags contain 2 shiny gold bags, 2 plaid coral bags.
striped aqua bags contain 3 dark chartreuse bags.
light orange bags contain 1 plaid red bag, 3 wavy salmon bags, 4 dotted indigo bags.
dotted lavender bags contain 4 dotted tomato bags, 3 plaid cyan bags.
light bronze bags contain 3 drab purple bags, 4 dotted crimson bags, 1 posh bronze bag.
dim tomato bags contain 4 dotted tan bags, 2 vibrant brown bags, 5 vibrant orange bags, 2 dotted silver bags.
striped plum bags contain 4 wavy indigo bags, 5 dim indigo bags, 3 vibrant green bags.
clear beige bags contain 3 muted bronze bags.
shiny coral bags contain 2 posh silver bags.
dull violet bags contain 5 bright teal bags, 3 plaid violet bags, 3 drab turquoise bags, 3 dull maroon bags.
posh yellow bags contain 2 light maroon bags, 3 light fuchsia bags, 1 shiny indigo bag.
dark tan bags contain 3 plaid yellow bags, 2 striped salmon bags.
shiny fuchsia bags contain 2 faded red bags, 3 dim violet bags, 4 wavy crimson bags.
clear purple bags contain 3 shiny chartreuse bags.
dim turquoise bags contain 5 vibrant magenta bags, 2 striped tomato bags.
light turquoise bags contain 5 wavy crimson bags, 3 dim beige bags, 2 bright teal bags, 3 posh maroon bags.
mirrored magenta bags contain 1 shiny turquoise bag.
clear blue bags contain 3 dark black bags, 4 faded fuchsia bags.
muted gray bags contain 1 light chartreuse bag.
wavy maroon bags contain 4 bright magenta bags, 1 vibrant orange bag.
shiny silver bags contain 4 dull white bags, 5 striped aqua bags.
clear silver bags contain 3 vibrant coral bags, 4 light gray bags, 4 shiny maroon bags.
wavy magenta bags contain 5 clear red bags, 4 shiny yellow bags, 2 dark green bags, 1 shiny cyan bag.
dull green bags contain 2 vibrant salmon bags.
wavy red bags contain 4 bright indigo bags.
wavy turquoise bags contain 4 clear gray bags, 4 dark chartreuse bags, 4 dark lavender bags.
faded tomato bags contain 5 wavy salmon bags, 1 muted salmon bag, 2 muted black bags.
dark orange bags contain 3 dim red bags, 3 dim silver bags, 2 muted beige bags, 5 bright silver bags.
shiny tomato bags contain 3 bright green bags, 3 dark blue bags, 2 wavy chartreuse bags.
clear fuchsia bags contain 2 dotted tan bags, 4 posh plum bags, 3 light green bags, 4 drab crimson bags.
pale tomato bags contain 3 faded bronze bags.
dull coral bags contain 5 plaid magenta bags, 1 mirrored cyan bag, 1 dark black bag.
pale gray bags contain 1 bright tan bag.
drab olive bags contain 2 posh blue bags, 1 dim salmon bag, 3 posh orange bags, 5 posh maroon bags.
plaid beige bags contain 3 muted olive bags, 2 drab fuchsia bags.
dotted coral bags contain 2 dark magenta bags.
bright magenta bags contain no other bags.
striped violet bags contain 1 plaid gray bag, 5 dull white bags, 3 dark indigo bags, 1 shiny orange bag.
plaid tomato bags contain 1 dotted orange bag, 5 bright silver bags.
wavy silver bags contain no other bags.
wavy bronze bags contain 5 plaid beige bags, 5 dark coral bags, 5 vibrant orange bags.
clear black bags contain 3 wavy beige bags.
drab teal bags contain 5 dull gray bags, 1 light yellow bag, 3 drab indigo bags, 1 bright maroon bag.
dim lavender bags contain 4 shiny lavender bags.
pale olive bags contain 4 wavy olive bags, 4 faded olive bags.
shiny turquoise bags contain 5 clear magenta bags, 1 mirrored aqua bag, 2 light lime bags, 2 dark indigo bags.
clear brown bags contain 1 dotted fuchsia bag, 4 clear white bags.
pale red bags contain 4 clear beige bags.
bright maroon bags contain 4 clear black bags, 2 vibrant white bags.
pale teal bags contain 3 pale silver bags, 2 wavy tomato bags.
plaid orange bags contain 5 shiny magenta bags.
posh plum bags contain 2 clear beige bags, 5 faded silver bags, 5 drab beige bags, 4 dim crimson bags.
pale maroon bags contain 1 posh maroon bag, 4 wavy magenta bags.
shiny black bags contain 1 dotted tomato bag, 1 mirrored silver bag, 5 plaid maroon bags, 5 clear salmon bags.
shiny lavender bags contain 5 muted bronze bags.
wavy violet bags contain 2 dotted tomato bags, 5 bright black bags, 4 clear cyan bags.
dotted tan bags contain 4 plaid teal bags.
drab tomato bags contain 5 dark black bags.
dull olive bags contain 1 clear salmon bag.
faded orange bags contain 2 light maroon bags, 3 posh lime bags, 4 dotted tan bags.
plaid purple bags contain 5 drab aqua bags, 3 clear plum bags, 2 pale purple bags.
wavy fuchsia bags contain 3 faded orange bags, 1 muted purple bag.
pale white bags contain 5 dark indigo bags, 1 pale tan bag.
bright olive bags contain 1 dull lime bag, 3 light fuchsia bags.
drab black bags contain 4 muted violet bags, 2 vibrant violet bags.
drab lime bags contain 5 dark brown bags, 5 striped indigo bags.
striped green bags contain 5 vibrant green bags, 3 striped silver bags, 2 dull turquoise bags, 4 drab indigo bags.
wavy olive bags contain 3 mirrored gray bags, 1 light lime bag, 2 bright indigo bags.
posh indigo bags contain 2 dotted fuchsia bags, 3 dotted purple bags, 2 wavy brown bags, 2 dotted blue bags.
clear crimson bags contain 5 drab gray bags, 2 plaid beige bags, 4 dark gold bags, 2 pale chartreuse bags.
pale lime bags contain 1 dotted plum bag, 2 vibrant maroon bags.
pale gold bags contain 4 posh tomato bags.
posh tomato bags contain 4 mirrored lime bags.
muted indigo bags contain 5 wavy fuchsia bags, 3 clear orange bags, 3 shiny green bags.
clear green bags contain 3 drab salmon bags, 4 pale turquoise bags.
mirrored yellow bags contain 5 dim red bags.
pale bronze bags contain 1 dotted chartreuse bag, 1 drab teal bag, 4 shiny cyan bags, 5 faded brown bags.
shiny maroon bags contain 2 wavy turquoise bags, 5 light turquoise bags, 5 wavy cyan bags.
dark magenta bags contain 4 mirrored lime bags, 3 drab aqua bags, 4 bright blue bags, 2 posh silver bags.
drab gold bags contain 2 light gray bags, 3 bright magenta bags, 2 vibrant magenta bags, 4 light lime bags.
drab brown bags contain 2 wavy salmon bags, 5 posh plum bags, 4 shiny orange bags.
dull gray bags contain 2 dim violet bags.
muted magenta bags contain 5 posh lavender bags, 2 dotted orange bags, 4 pale turquoise bags.
vibrant bronze bags contain 5 dim blue bags, 3 mirrored silver bags.
pale crimson bags contain 2 dark coral bags.
dotted cyan bags contain 2 clear salmon bags, 4 dark white bags.
light white bags contain 5 clear silver bags, 4 clear olive bags.
dim coral bags contain 3 drab silver bags, 5 shiny teal bags, 4 faded bronze bags, 4 muted plum bags.
dotted beige bags contain 1 light yellow bag, 4 light lime bags.
faded turquoise bags contain 4 dotted tomato bags, 3 pale magenta bags, 2 dim brown bags.
shiny brown bags contain 5 faded red bags.
striped yellow bags contain 3 mirrored crimson bags, 4 dark magenta bags, 3 pale crimson bags, 2 mirrored black bags.
shiny magenta bags contain 1 vibrant tomato bag, 3 mirrored lavender bags.
clear indigo bags contain 4 muted tomato bags, 3 posh red bags, 5 pale turquoise bags, 3 dim olive bags.
striped silver bags contain 4 drab maroon bags, 2 drab chartreuse bags, 2 dotted gray bags.
mirrored black bags contain 1 wavy beige bag, 1 dim silver bag.
faded cyan bags contain 3 dim crimson bags, 3 drab aqua bags.
posh lavender bags contain 2 light gray bags, 1 dim orange bag.
dim violet bags contain 2 posh maroon bags, 4 clear salmon bags.
plaid tan bags contain 5 shiny indigo bags, 1 shiny fuchsia bag.
posh maroon bags contain 5 dark magenta bags, 1 drab silver bag, 5 drab red bags.
striped turquoise bags contain 1 dull lime bag.
wavy tomato bags contain 3 dotted gray bags, 5 dull blue bags, 3 dotted purple bags.
drab fuchsia bags contain 5 drab red bags, 2 mirrored lime bags.
dotted green bags contain 5 posh turquoise bags.
pale chartreuse bags contain 1 striped beige bag, 5 dark chartreuse bags.
plaid cyan bags contain 3 drab gold bags, 1 light gray bag, 2 bright violet bags, 3 dark chartreuse bags.
dull blue bags contain 4 dotted yellow bags.
vibrant crimson bags contain 1 dotted beige bag.
light crimson bags contain 2 light black bags, 2 dotted beige bags.
posh turquoise bags contain 1 posh lavender bag, 4 vibrant orange bags, 4 shiny lavender bags.
dull beige bags contain 5 dull salmon bags.
shiny orange bags contain 5 drab gray bags, 1 plaid chartreuse bag, 5 dim crimson bags.
muted crimson bags contain 3 light cyan bags, 3 dull fuchsia bags, 2 bright red bags.
shiny gray bags contain 2 bright fuchsia bags, 5 vibrant maroon bags, 1 bright teal bag, 3 striped magenta bags.
bright brown bags contain 3 mirrored violet bags, 1 light aqua bag, 5 bright maroon bags.
faded teal bags contain 5 faded gray bags, 5 pale indigo bags, 5 plaid cyan bags.
faded violet bags contain 1 shiny fuchsia bag, 5 faded gray bags.
striped purple bags contain 2 wavy olive bags.
muted tan bags contain 1 clear red bag, 1 shiny crimson bag, 3 faded violet bags.
light chartreuse bags contain 5 faded turquoise bags.
mirrored bronze bags contain 4 wavy indigo bags.
plaid turquoise bags contain 5 pale aqua bags, 4 faded indigo bags.
drab aqua bags contain 1 light silver bag, 2 plaid bronze bags, 2 light black bags, 3 muted bronze bags.
posh red bags contain 5 faded aqua bags, 2 posh coral bags, 5 light lime bags, 3 faded gray bags.
bright aqua bags contain 5 faded orange bags, 2 bright silver bags, 1 posh fuchsia bag, 3 pale blue bags.
faded yellow bags contain 1 mirrored olive bag.
faded red bags contain 4 drab gold bags, 5 shiny turquoise bags.
wavy gray bags contain 1 dull salmon bag, 5 posh brown bags, 1 drab bronze bag.
striped fuchsia bags contain 3 faded tan bags, 5 posh turquoise bags, 2 dotted turquoise bags.
vibrant chartreuse bags contain 2 posh lavender bags, 1 plaid cyan bag, 3 muted brown bags.
faded chartreuse bags contain 4 drab gold bags, 3 faded gray bags.
dim chartreuse bags contain 3 dark maroon bags, 5 dim brown bags.
clear plum bags contain 2 dotted indigo bags, 5 dark white bags, 3 plaid indigo bags, 5 bright beige bags.
faded gold bags contain 4 dim beige bags, 3 light maroon bags, 4 vibrant brown bags, 3 muted olive bags.
dull fuchsia bags contain 5 dark white bags, 3 pale magenta bags, 1 bright blue bag, 3 drab salmon bags.
bright yellow bags contain 1 clear indigo bag, 5 dark white bags, 4 shiny indigo bags, 5 light orange bags.
faded aqua bags contain 3 drab red bags, 1 muted olive bag, 3 vibrant green bags.
shiny red bags contain 4 faded chartreuse bags, 1 plaid salmon bag, 5 clear crimson bags.
vibrant salmon bags contain 2 drab magenta bags.
vibrant plum bags contain 5 drab maroon bags, 3 plaid coral bags.
dull black bags contain 3 posh indigo bags, 4 light gray bags, 3 wavy salmon bags.
muted black bags contain 1 faded salmon bag, 4 dark blue bags.
dim cyan bags contain 1 posh salmon bag, 5 bright teal bags, 3 shiny olive bags.
posh blue bags contain 3 bright magenta bags, 4 light black bags, 2 vibrant orange bags.
light silver bags contain 2 shiny yellow bags.
drab coral bags contain 1 shiny chartreuse bag, 1 pale blue bag.
drab blue bags contain 1 bright lavender bag, 3 vibrant violet bags, 5 shiny yellow bags.
bright bronze bags contain 5 posh tomato bags, 5 plaid beige bags.
faded gray bags contain 1 vibrant brown bag, 3 posh lavender bags.
dark plum bags contain 3 dull bronze bags, 3 light coral bags.
light yellow bags contain 3 drab silver bags.
dim aqua bags contain 4 wavy beige bags, 5 light maroon bags.
dim orange bags contain no other bags.
light olive bags contain 5 pale olive bags, 5 pale violet bags.
shiny indigo bags contain 4 plaid brown bags, 1 vibrant teal bag, 4 light black bags, 3 faded bronze bags.
light teal bags contain 5 dull cyan bags, 2 dim salmon bags.
dotted aqua bags contain 4 bright orange bags, 3 drab fuchsia bags, 3 dotted gray bags.
pale beige bags contain 3 wavy maroon bags.
posh lime bags contain 3 striped chartreuse bags, 4 drab gold bags, 3 light gray bags, 3 dim lavender bags.
mirrored silver bags contain 1 wavy salmon bag, 2 drab yellow bags, 2 dotted gray bags.
muted bronze bags contain 5 vibrant magenta bags, 4 light gray bags, 4 light lime bags.
bright violet bags contain no other bags.
dotted fuchsia bags contain 1 dark indigo bag, 4 vibrant brown bags, 4 plaid olive bags, 5 muted olive bags.
posh tan bags contain 4 plaid beige bags, 4 dark indigo bags.
faded tan bags contain 4 bright tan bags, 4 mirrored plum bags, 5 striped tomato bags.
plaid fuchsia bags contain 1 wavy purple bag, 4 shiny teal bags, 3 shiny plum bags, 2 wavy white bags.
pale silver bags contain 3 plaid green bags, 3 drab chartreuse bags, 4 posh bronze bags.
plaid yellow bags contain 1 pale aqua bag, 2 drab chartreuse bags.
dark gold bags contain 3 wavy salmon bags.
mirrored tan bags contain 3 bright violet bags.
dotted crimson bags contain 3 dark magenta bags, 1 posh tomato bag.
bright beige bags contain 2 dark indigo bags, 5 dotted beige bags, 1 drab beige bag, 3 striped aqua bags.
plaid teal bags contain 1 dotted gold bag, 1 posh bronze bag.
vibrant magenta bags contain no other bags.
clear tomato bags contain 5 pale indigo bags.
light violet bags contain 5 drab indigo bags, 1 pale violet bag, 5 drab purple bags, 2 vibrant tomato bags.
pale salmon bags contain 2 posh plum bags.
plaid gray bags contain 1 vibrant gray bag, 1 bright gold bag.
muted blue bags contain 1 shiny white bag, 4 pale teal bags, 4 dim crimson bags, 4 vibrant chartreuse bags.
muted aqua bags contain 5 wavy teal bags.
dim teal bags contain 4 plaid blue bags.
dim olive bags contain 4 dim silver bags, 1 faded brown bag.
posh coral bags contain 3 striped blue bags, 2 plaid olive bags, 3 plaid teal bags, 3 clear beige bags.
wavy lime bags contain 4 dull green bags, 1 posh maroon bag, 5 dotted lavender bags.
dark chartreuse bags contain no other bags.
dotted yellow bags contain 5 bright magenta bags.
light fuchsia bags contain 1 plaid coral bag, 1 posh silver bag, 3 light orange bags.
dark purple bags contain 2 plaid bronze bags, 3 posh chartreuse bags, 1 light magenta bag.
striped tan bags contain 1 clear black bag, 1 posh blue bag, 4 faded salmon bags.
vibrant tan bags contain 1 pale red bag, 2 dull lime bags, 4 posh plum bags.
bright turquoise bags contain 4 drab aqua bags, 5 dull blue bags.
dull purple bags contain 1 striped fuchsia bag, 3 dark lavender bags.
light purple bags contain 3 bright blue bags, 5 mirrored beige bags, 2 muted beige bags.
plaid aqua bags contain 4 dotted indigo bags, 1 muted aqua bag.
shiny tan bags contain 3 pale magenta bags, 5 drab salmon bags, 2 dotted gold bags.
light brown bags contain 5 posh tomato bags, 1 light gray bag, 1 bright gold bag, 4 posh violet bags.
posh bronze bags contain 2 light black bags, 5 dim lavender bags.
dim red bags contain no other bags.
pale yellow bags contain 3 bright tan bags, 3 plaid magenta bags.
dim salmon bags contain 4 dark white bags, 5 dotted brown bags, 1 striped aqua bag.
muted green bags contain 4 dim brown bags, 3 posh tan bags, 4 shiny olive bags, 4 clear fuchsia bags.
drab maroon bags contain 4 dull olive bags, 2 dotted black bags.
dotted black bags contain 2 dotted fuchsia bags, 3 dim aqua bags, 4 light orange bags, 5 light red bags.
striped lime bags contain 1 clear crimson bag.
dim gray bags contain 4 striped lavender bags, 1 wavy salmon bag, 3 posh violet bags, 3 dotted brown bags.
drab red bags contain 2 dim brown bags, 4 light lime bags.
muted olive bags contain 1 dark coral bag, 2 wavy silver bags, 5 drab silver bags, 5 pale fuchsia bags.
shiny crimson bags contain 5 light crimson bags, 2 clear magenta bags.
vibrant green bags contain 4 light orange bags.
wavy purple bags contain 5 dull brown bags.
mirrored indigo bags contain 3 clear bronze bags, 1 pale tan bag, 1 faded tomato bag.
dull white bags contain 3 dim beige bags, 2 light yellow bags, 2 dark indigo bags, 2 muted bronze bags.
bright tan bags contain 2 posh blue bags, 3 striped chartreuse bags.
mirrored olive bags contain 1 wavy maroon bag, 5 wavy silver bags, 5 shiny beige bags.
faded white bags contain 4 bright bronze bags, 1 plaid brown bag, 5 vibrant yellow bags, 2 drab indigo bags.
muted teal bags contain 2 striped crimson bags, 1 dim orange bag, 5 posh green bags.
faded coral bags contain 1 dim beige bag, 1 striped brown bag, 4 pale indigo bags, 1 posh fuchsia bag.
dim green bags contain 3 dark maroon bags, 4 striped chartreuse bags, 1 wavy purple bag.
wavy gold bags contain 3 clear aqua bags, 2 dim orange bags.
dotted purple bags contain 4 dotted indigo bags, 4 drab aqua bags, 2 dark coral bags, 3 muted beige bags.
dark beige bags contain 5 shiny fuchsia bags.
posh fuchsia bags contain 3 vibrant white bags.
mirrored maroon bags contain 3 dull white bags, 2 plaid gold bags, 4 plaid maroon bags, 2 bright crimson bags.
dim tan bags contain 1 dark white bag, 5 posh black bags, 3 plaid brown bags, 1 posh bronze bag.
posh purple bags contain 5 clear tomato bags.
dark tomato bags contain 1 posh lime bag.
dim gold bags contain 1 posh salmon bag, 5 dark red bags, 4 dark black bags, 2 faded orange bags.
plaid white bags contain 2 clear olive bags, 2 mirrored cyan bags, 3 muted white bags.
dull brown bags contain 5 plaid tomato bags, 2 dotted black bags.
light gold bags contain 3 plaid gold bags, 4 posh salmon bags, 2 dotted blue bags, 5 dull gray bags.
dark silver bags contain 2 light gray bags, 3 dotted fuchsia bags, 2 light red bags.
plaid green bags contain 4 light maroon bags, 1 striped tomato bag, 4 drab beige bags.
dull turquoise bags contain 2 light maroon bags, 3 posh silver bags, 5 dim lavender bags, 5 vibrant orange bags.
dark violet bags contain 3 wavy maroon bags, 1 clear salmon bag, 5 light yellow bags.
wavy brown bags contain 3 dim white bags.
faded magenta bags contain 3 dark silver bags, 4 vibrant purple bags, 1 dark white bag.
muted cyan bags contain 5 shiny beige bags, 3 muted white bags.
mirrored chartreuse bags contain 3 mirrored maroon bags, 2 faded indigo bags, 1 pale red bag.
mirrored turquoise bags contain 1 drab gold bag.
shiny purple bags contain 3 faded yellow bags, 2 pale aqua bags, 5 vibrant red bags.
faded lavender bags contain 2 dim gray bags, 3 dim blue bags, 4 dark black bags.
dotted blue bags contain 2 posh lime bags, 1 dotted beige bag, 4 mirrored aqua bags.
wavy cyan bags contain 3 dotted turquoise bags, 2 dark lime bags, 4 dotted crimson bags, 1 dotted lime bag.
faded lime bags contain 1 faded bronze bag, 5 dotted purple bags, 4 light orange bags.
striped red bags contain 1 shiny teal bag.
light indigo bags contain 5 shiny olive bags, 4 dim magenta bags, 5 plaid magenta bags, 5 dark violet bags.
wavy yellow bags contain 3 bright aqua bags, 1 dull blue bag, 1 bright olive bag.
posh beige bags contain 2 posh orange bags, 3 dotted olive bags, 3 dull yellow bags, 1 wavy white bag.
muted turquoise bags contain 4 bright silver bags, 4 wavy silver bags.
drab purple bags contain 5 bright tan bags.
vibrant lime bags contain 3 plaid magenta bags, 2 vibrant white bags, 2 dark gold bags, 1 light green bag.
clear violet bags contain 3 muted red bags, 4 posh yellow bags, 2 pale indigo bags.
pale fuchsia bags contain 2 wavy beige bags, 2 plaid bronze bags, 2 wavy silver bags.
plaid black bags contain 4 pale olive bags, 3 pale fuchsia bags.
vibrant violet bags contain 1 plaid red bag, 5 drab red bags, 5 pale gray bags.
mirrored crimson bags contain 1 dotted fuchsia bag.
posh aqua bags contain 3 plaid teal bags.
shiny teal bags contain 4 dotted black bags.
drab orange bags contain 5 dotted teal bags, 4 drab white bags, 3 pale olive bags.
posh chartreuse bags contain 3 drab gray bags.
plaid indigo bags contain 2 striped tomato bags.
plaid lime bags contain 5 drab purple bags.
dull tomato bags contain 2 wavy turquoise bags.
wavy black bags contain 5 mirrored blue bags, 5 striped tan bags.
posh brown bags contain 3 wavy purple bags, 1 mirrored violet bag.
dim purple bags contain 5 clear gray bags, 1 plaid green bag, 3 light green bags.
dotted indigo bags contain 4 drab silver bags.
striped cyan bags contain 5 light orange bags, 1 dim chartreuse bag, 1 bright blue bag, 5 dim coral bags.
striped brown bags contain 1 light turquoise bag, 1 mirrored coral bag.
wavy salmon bags contain 2 vibrant orange bags, 2 drab silver bags, 3 bright blue bags, 1 vibrant brown bag.
drab lavender bags contain 5 dotted fuchsia bags, 1 plaid green bag, 4 posh salmon bags.
drab silver bags contain 4 muted bronze bags, 2 drab gold bags.
plaid maroon bags contain 1 vibrant brown bag, 4 shiny yellow bags, 3 bright blue bags, 5 drab gold bags.
vibrant beige bags contain 2 drab indigo bags, 2 dim aqua bags.
mirrored green bags contain 1 dim coral bag, 5 muted orange bags, 1 dotted purple bag.
drab indigo bags contain 4 dotted magenta bags, 3 drab lavender bags, 4 dotted lime bags, 5 wavy aqua bags.
faded black bags contain 4 plaid gold bags.
muted violet bags contain 2 drab aqua bags, 2 light crimson bags, 2 posh tomato bags.
posh orange bags contain 3 shiny salmon bags.
bright gray bags contain 1 mirrored gray bag, 3 mirrored magenta bags, 1 clear salmon bag.
plaid plum bags contain 3 striped magenta bags, 1 drab fuchsia bag.
posh black bags contain 5 dotted orange bags, 2 muted beige bags.
striped maroon bags contain 5 clear gold bags, 5 clear tomato bags, 4 muted cyan bags, 1 pale coral bag.
dim indigo bags contain 1 shiny lavender bag, 2 posh blue bags, 3 drab silver bags.
clear magenta bags contain 3 dark magenta bags, 2 drab gold bags, 4 dull white bags, 5 light maroon bags.
plaid red bags contain 4 drab violet bags, 4 vibrant brown bags.
light gray bags contain no other bags.
clear red bags contain 3 drab purple bags, 2 pale magenta bags, 2 bright violet bags.
pale coral bags contain 5 muted chartreuse bags, 4 plaid olive bags.
dull red bags contain 4 drab lavender bags, 5 bright orange bags, 5 dull white bags.
clear lavender bags contain 4 wavy brown bags, 1 faded bronze bag.
dim beige bags contain 3 dotted tomato bags, 4 bright magenta bags.
striped orange bags contain 4 vibrant lime bags, 1 vibrant tomato bag, 1 faded plum bag.
drab beige bags contain 1 light lime bag, 1 shiny lavender bag, 2 striped tomato bags, 1 dim orange bag.
mirrored tomato bags contain 2 posh bronze bags.
mirrored violet bags contain 3 dotted lime bags, 2 dotted teal bags.
muted silver bags contain 1 bright salmon bag, 3 shiny crimson bags, 1 dim tomato bag.
clear gold bags contain 1 dark violet bag.
faded beige bags contain 1 dull fuchsia bag, 4 shiny yellow bags.
mirrored red bags contain 5 wavy lavender bags, 2 wavy silver bags.
wavy coral bags contain 4 drab yellow bags.
shiny yellow bags contain 1 shiny lavender bag, 5 drab silver bags, 4 drab gold bags.
shiny chartreuse bags contain 5 faded brown bags.
light black bags contain 1 plaid cyan bag, 5 dark chartreuse bags, 5 muted bronze bags.
bright blue bags contain 3 drab silver bags, 5 dim orange bags.
mirrored gray bags contain 4 pale indigo bags.
shiny gold bags contain 1 dim lavender bag, 5 mirrored gray bags, 1 light maroon bag.
faded plum bags contain 2 shiny orange bags, 1 pale plum bag, 2 posh coral bags, 3 shiny white bags.
dotted olive bags contain 1 drab aqua bag, 4 posh black bags, 3 pale salmon bags, 2 dotted yellow bags.
vibrant tomato bags contain 3 muted brown bags, 4 faded teal bags, 4 dotted brown bags.
vibrant yellow bags contain 1 drab coral bag, 3 dark purple bags, 1 wavy crimson bag.
muted coral bags contain 1 dark plum bag, 3 wavy blue bags, 3 bright yellow bags, 4 dark maroon bags.
dark white bags contain 1 dim brown bag, 2 drab gray bags, 3 clear cyan bags.
light salmon bags contain 4 dim violet bags, 2 shiny gold bags, 5 pale turquoise bags.
dark green bags contain 1 pale yellow bag, 5 shiny gold bags.
dark lime bags contain 2 plaid red bags, 4 dotted tomato bags, 4 posh bronze bags.
light tan bags contain 5 light coral bags.
striped gold bags contain 3 vibrant maroon bags, 4 clear lime bags.
dotted silver bags contain 3 striped aqua bags, 2 mirrored aqua bags, 1 vibrant brown bag.
dull aqua bags contain 4 pale gray bags, 4 mirrored cyan bags, 2 shiny turquoise bags, 5 striped crimson bags.
shiny plum bags contain 2 plaid green bags, 3 light crimson bags.
faded indigo bags contain 5 light tomato bags, 3 pale indigo bags, 1 shiny magenta bag, 5 muted tomato bags.
striped blue bags contain 2 shiny crimson bags, 3 wavy crimson bags, 4 dotted red bags.
muted salmon bags contain 1 faded red bag, 1 dim gray bag, 2 dotted gray bags.
pale aqua bags contain 5 clear magenta bags, 3 dim beige bags.
pale plum bags contain 5 bright indigo bags, 2 light crimson bags, 1 muted white bag.
pale green bags contain 5 bright aqua bags, 1 dull fuchsia bag.
wavy tan bags contain 2 posh tomato bags.
wavy teal bags contain 2 mirrored violet bags.
dim maroon bags contain 3 drab fuchsia bags.
bright silver bags contain 5 dull black bags.
plaid magenta bags contain 2 muted olive bags, 5 mirrored plum bags, 1 posh lavender bag.
wavy lavender bags contain 3 pale salmon bags, 4 wavy green bags, 5 posh yellow bags.
striped olive bags contain 2 pale fuchsia bags, 1 pale silver bag, 4 dull brown bags, 4 dim blue bags.
shiny cyan bags contain 2 light tomato bags, 2 faded indigo bags, 3 drab lime bags.
bright white bags contain 4 dark orange bags.
mirrored lavender bags contain 3 drab gold bags, 4 mirrored white bags, 4 bright orange bags, 1 pale gray bag.
dark brown bags contain 1 dark chartreuse bag, 2 muted bronze bags, 3 bright magenta bags, 5 striped chartreuse bags.
dark blue bags contain 5 vibrant brown bags, 4 drab maroon bags, 5 wavy brown bags, 3 drab silver bags.
bright gold bags contain 5 dark silver bags.
dotted gray bags contain 1 posh bronze bag, 5 drab fuchsia bags, 3 mirrored gray bags, 1 clear cyan bag.
clear teal bags contain 1 dim beige bag.
drab yellow bags contain 3 bright blue bags.
bright purple bags contain 2 posh lavender bags.
shiny bronze bags contain 1 faded red bag.
dark black bags contain 2 mirrored beige bags, 3 wavy silver bags.
mirrored coral bags contain 3 drab beige bags, 3 wavy silver bags, 4 dim lavender bags, 4 drab silver bags.
dim white bags contain 4 posh bronze bags.
dim brown bags contain 1 muted bronze bag, 2 drab gold bags, 4 striped tomato bags, 5 drab silver bags.
striped white bags contain 1 dotted crimson bag, 4 pale indigo bags, 2 dark chartreuse bags, 1 dotted brown bag.
dark coral bags contain 2 dark brown bags, 4 mirrored plum bags, 4 bright tan bags, 5 posh blue bags.
faded bronze bags contain 4 drab fuchsia bags, 1 plaid yellow bag.
dim fuchsia bags contain 3 plaid yellow bags, 1 wavy coral bag, 2 dotted blue bags.
mirrored blue bags contain 5 dull crimson bags, 1 pale chartreuse bag, 3 vibrant plum bags.
wavy plum bags contain 1 pale olive bag, 1 bright red bag, 3 clear tan bags, 2 drab gray bags.
plaid bronze bags contain 5 wavy silver bags, 4 bright magenta bags, 1 dim orange bag.
dotted tomato bags contain 1 vibrant brown bag, 5 mirrored gray bags.
dim yellow bags contain 1 vibrant teal bag, 5 plaid white bags.
faded olive bags contain 4 wavy beige bags.
bright coral bags contain 2 muted maroon bags, 2 posh indigo bags.
mirrored aqua bags contain 1 light gray bag.
faded blue bags contain 1 vibrant tomato bag, 1 mirrored salmon bag.
mirrored fuchsia bags contain 5 plaid beige bags, 5 clear violet bags.
bright orange bags contain 3 dull turquoise bags, 3 striped blue bags, 3 posh maroon bags, 5 dotted brown bags.
drab white bags contain 5 drab maroon bags, 3 shiny coral bags, 1 drab gray bag.
plaid blue bags contain 5 light turquoise bags, 4 dark violet bags, 1 bright indigo bag, 3 dull fuchsia bags.
bright tomato bags contain 4 vibrant tomato bags, 1 dull purple bag, 4 clear tomato bags, 2 dotted yellow bags.
dark gray bags contain 3 light green bags, 3 dull teal bags, 2 wavy chartreuse bags, 1 vibrant coral bag.
light lime bags contain no other bags.
dim magenta bags contain 2 light gold bags, 4 dotted teal bags, 3 dull crimson bags.
vibrant cyan bags contain 2 dark brown bags, 1 dim crimson bag.
dotted salmon bags contain 2 shiny magenta bags, 4 dark orange bags, 3 striped lavender bags, 3 mirrored violet bags.
plaid chartreuse bags contain 3 dull crimson bags, 1 dull red bag, 4 posh white bags, 5 bright indigo bags.
muted plum bags contain 1 clear salmon bag, 3 mirrored lime bags.
dark bronze bags contain 4 clear chartreuse bags.
dim blue bags contain 4 light yellow bags, 5 mirrored beige bags.
vibrant gold bags contain 4 muted bronze bags, 4 plaid gold bags.
drab gray bags contain 1 dark chartreuse bag.
dotted lime bags contain 1 dotted indigo bag, 4 dull gray bags, 3 drab gray bags, 4 shiny bronze bags.
mirrored orange bags contain 5 mirrored tan bags.
dark lavender bags contain 3 dim chartreuse bags, 4 posh black bags, 1 clear beige bag.
muted lime bags contain 1 vibrant violet bag.
dull indigo bags contain 3 faded indigo bags, 5 bright orange bags, 4 posh turquoise bags, 1 dim gray bag.
pale magenta bags contain 5 dotted gray bags, 3 drab silver bags, 2 wavy salmon bags.
plaid lavender bags contain 5 vibrant tomato bags.
clear bronze bags contain 3 shiny crimson bags.
bright salmon bags contain 5 mirrored bronze bags, 2 clear black bags, 4 plaid green bags, 5 faded red bags.
wavy indigo bags contain 3 shiny lavender bags, 3 vibrant brown bags, 2 dotted beige bags, 4 wavy brown bags.
light maroon bags contain 3 light black bags, 3 plaid maroon bags, 2 wavy silver bags, 5 vibrant brown bags.
muted gold bags contain 5 posh black bags.
dull lavender bags contain 3 plaid beige bags, 4 clear cyan bags, 5 striped aqua bags, 4 dotted gray bags.
muted brown bags contain 1 faded olive bag, 2 drab gray bags, 5 wavy salmon bags.
dotted orange bags contain 2 dotted red bags.
dim plum bags contain 5 drab lime bags, 1 plaid tan bag.
muted orange bags contain 3 plaid green bags.
dull chartreuse bags contain 4 dark maroon bags, 5 vibrant tan bags, 1 mirrored coral bag, 5 dull lime bags.
striped gray bags contain 2 vibrant crimson bags.
posh gray bags contain 3 dark orange bags.
shiny lime bags contain 4 muted yellow bags, 2 wavy cyan bags.
dull lime bags contain 1 drab purple bag.
striped bronze bags contain 2 dim white bags, 1 dim coral bag, 3 light maroon bags, 5 dim blue bags.
wavy orange bags contain 2 pale blue bags, 3 muted violet bags.
pale brown bags contain 3 wavy indigo bags, 1 bright green bag.
dull silver bags contain 5 wavy aqua bags, 5 shiny maroon bags, 5 dotted chartreuse bags.
bright red bags contain 2 dark gold bags, 5 dark tan bags.
dotted brown bags contain 1 striped turquoise bag.
plaid crimson bags contain 3 posh white bags, 4 pale plum bags, 3 dark orange bags, 3 shiny magenta bags.
dotted plum bags contain 5 posh blue bags, 5 dark indigo bags, 5 wavy silver bags.
light tomato bags contain 3 light purple bags, 5 clear plum bags.
dull bronze bags contain 3 clear magenta bags, 1 faded tan bag.
drab turquoise bags contain 2 posh lavender bags, 2 faded tomato bags, 5 mirrored tomato bags.
striped lavender bags contain 2 dotted turquoise bags, 5 plaid indigo bags.
pale violet bags contain 5 light red bags, 1 striped chartreuse bag, 1 drab chartreuse bag, 1 bright silver bag.
posh gold bags contain 2 bright blue bags.
dull maroon bags contain 4 dotted teal bags, 2 faded silver bags, 3 posh gray bags.
shiny beige bags contain 3 light orange bags, 4 drab fuchsia bags, 3 muted beige bags.
dim silver bags contain 1 dotted gold bag.
pale orange bags contain 5 dotted orange bags, 3 dim white bags.
wavy aqua bags contain 5 vibrant purple bags.
posh salmon bags contain 2 drab red bags.
clear tan bags contain 4 bright plum bags, 4 faded fuchsia bags, 1 mirrored crimson bag, 1 faded salmon bag.
clear orange bags contain 1 drab aqua bag.
posh violet bags contain 2 vibrant magenta bags, 3 mirrored plum bags, 5 light orange bags.
dull crimson bags contain 5 faded violet bags, 3 dim indigo bags, 2 light red bags, 2 clear red bags.
mirrored teal bags contain 1 drab teal bag.
drab violet bags contain 2 mirrored plum bags, 4 drab red bags.
shiny violet bags contain 5 shiny aqua bags, 1 striped brown bag, 1 dark blue bag, 5 wavy white bags.
2020/day08/input.txt
-596
View File
@@ -1,596 +0,0 @@
acc +40
jmp +187
acc +47
acc +20
acc -12
jmp +225
nop +488
acc +13
nop +462
jmp +374
acc +15
acc +42
jmp +116
acc +23
nop +216
acc -15
jmp +398
jmp +103
acc +17
acc +7
jmp +571
jmp +1
jmp +217
acc +7
jmp +1
acc +35
jmp +257
acc +24
nop +20
jmp +309
acc +2
acc -15
acc -13
nop +457
jmp +19
acc +46
acc +45
acc +35
jmp +295
acc -15
acc +49
acc +22
jmp +400
jmp +202
nop -38
jmp +381
acc +0
jmp +137
acc +27
jmp +196
acc +46
acc -15
jmp +348
jmp +457
acc +50
acc +8
jmp +452
acc -14
nop +321
acc +39
jmp +273
acc -9
jmp +413
acc +32
jmp +64
acc +18
jmp +152
acc -4
acc +9
acc +10
acc -1
jmp +433
acc +40
jmp -55
acc +28
nop +279
jmp +145
acc +24
nop +416
acc +45
jmp +45
acc +0
acc +49
acc -14
jmp +44
acc +17
acc +18
nop +224
acc +3
jmp +261
jmp -84
acc -11
acc +29
acc +42
jmp -13
acc -5
jmp +210
acc +26
acc -19
acc -19
jmp -82
acc +29
acc +31
acc -4
jmp +53
acc +46
jmp +139
acc +45
acc +30
jmp +1
jmp +418
jmp +248
acc +24
acc +15
acc +34
acc +17
jmp +52
acc +23
acc +18
jmp +65
jmp +1
acc +37
acc +25
jmp +385
jmp +281
nop +345
jmp -25
jmp +149
acc +21
acc +28
acc +15
jmp -74
jmp +179
jmp +287
acc +14
acc -3
acc -7
jmp -9
acc +17
acc -8
jmp +344
jmp +1
acc +36
acc -16
acc -17
jmp -82
jmp +1
acc +41
acc -8
acc +27
jmp +381
acc -10
nop -71
acc +23
nop +377
jmp -125
jmp +319
nop +119
nop +309
nop +195
jmp +307
acc +8
acc +31
jmp +1
acc -15
jmp +398
jmp +265
jmp -55
nop +143
jmp -36
acc +38
nop -38
jmp +298
acc -17
acc +39
acc -13
jmp -38
acc +23
jmp +133
acc +23
jmp -90
acc +14
jmp +1
jmp +100
nop +230
jmp +346
acc +36
jmp +14
jmp +126
jmp -32
jmp -142
acc +25
jmp +146
nop +118
acc -3
jmp +1
acc -8
jmp +101
nop +277
acc +27
jmp +328
acc -11
acc +17
nop +135
jmp +196
acc -9
jmp +39
nop +110
acc +14
nop +3
jmp +17
jmp +220
acc +17
jmp +5
acc +18
acc +39
acc -12
jmp -204
jmp +317
acc +37
jmp +222
nop +146
nop +248
jmp +182
acc +48
acc -13
jmp +174
jmp +342
nop -189
jmp +324
acc +35
acc +25
acc +21
jmp -152
nop -92
acc -3
acc -15
acc +30
jmp -157
acc -17
acc +37
acc +7
acc +5
jmp -225
jmp -177
acc +21
jmp +244
acc +42
acc -4
jmp -116
nop +225
nop -63
acc +20
jmp +195
acc +20
acc +21
jmp +228
acc +16
acc -8
acc +12
nop +188
jmp +9
acc +6
acc -13
acc +36
jmp -86
jmp -253
nop -60
acc +25
jmp -174
acc +10
nop -114
jmp -65
jmp +1
acc +24
jmp -150
acc +27
jmp -47
acc +50
nop -58
acc -17
acc -16
jmp -170
jmp -104
jmp -177
acc +46
jmp +106
jmp -206
acc +2
acc +10
acc +17
nop -107
jmp -126
jmp +1
acc +50
acc -14
acc +29
jmp -234
nop +144
acc +43
acc +34
jmp +221
jmp +1
nop +97
acc +39
jmp -60
acc +44
jmp -240
acc +11
acc +36
jmp -71
acc -5
jmp +149
jmp +54
acc +38
jmp +44
jmp -165
acc +14
jmp -134
acc +3
acc +22
nop +46
acc -12
jmp -57
acc +49
acc +24
acc +16
jmp +27
acc +6
nop -5
acc +45
acc +34
jmp -175
jmp -76
acc +3
acc +15
acc -19
jmp +1
nop -226
acc -2
jmp -55
jmp -284
acc +2
jmp +1
jmp +15
acc +11
acc +12
acc -1
acc +2
jmp +179
acc +19
acc +17
jmp -329
jmp -272
jmp -104
acc +41
nop +189
acc +47
jmp -88
acc +4
acc +16
acc +43
acc +25
jmp +71
acc -2
acc +45
jmp -173
jmp +1
acc +44
acc +33
jmp -53
acc +45
acc +9
acc +0
acc +12
jmp +178
jmp -100
acc +14
jmp -67
acc +42
jmp +201
acc +30
jmp -319
nop -4
nop -211
acc -3
nop -165
jmp -175
acc +12
acc -10
acc -14
jmp -53
acc -13
nop -143
jmp +159
acc -5
nop +18
nop -5
acc +13
jmp -248
jmp +114
acc +10
nop -396
nop -246
jmp +16
acc -3
acc +33
nop +174
acc +48
jmp -289
nop +98
acc +18
acc -17
jmp -137
jmp +1
acc +34
acc +36
jmp -216
acc +11
jmp -102
acc +10
jmp +10
acc +26
acc +35
acc -9
jmp -83
acc +15
nop -397
jmp -140
nop +111
jmp +139
jmp -165
acc +16
jmp -343
acc +8
acc +35
acc -17
acc -8
jmp +29
acc +50
nop -256
jmp -268
jmp +132
acc +13
acc +38
acc -6
acc -7
jmp -327
acc -8
jmp -256
nop -139
acc +30
jmp -60
acc -1
acc +11
jmp -216
acc -12
nop -390
acc +17
acc +39
jmp +101
acc +28
jmp +1
acc -7
acc -18
jmp -277
jmp -90
acc -10
jmp -326
jmp -368
nop -396
jmp -320
acc +42
acc +3
jmp -430
acc +47
acc +11
acc +19
acc +41
jmp -354
acc +30
acc +7
nop -106
jmp -420
acc +22
acc -15
jmp -296
acc -7
acc +48
jmp -19
jmp -148
acc +10
jmp +1
jmp +17
nop -273
acc +42
acc -4
nop -130
jmp +47
nop -436
acc -7
jmp +1
acc +42
jmp -330
acc +35
jmp +56
acc -19
jmp -440
jmp -335
jmp -279
nop -390
jmp +74
acc -5
jmp -456
acc +38
acc +3
jmp +47
acc +50
acc +26
acc +46
acc -7
jmp -491
acc -4
acc -7
acc +14
nop -105
jmp -487
jmp -326
nop -360
jmp -378
jmp -285
acc +46
jmp -190
acc +10
jmp -346
acc +49
jmp -492
acc -9
acc -17
jmp -147
acc +20
jmp -217
nop -183
acc +35
jmp -268
nop -51
jmp +1
jmp -440
acc +22
acc +24
jmp +1
acc +26
jmp -451
acc -14
acc +48
acc +3
jmp -363
acc +21
acc +24
acc +36
jmp -418
jmp -108
jmp -323
jmp +20
acc +1
acc +21
nop -212
acc -3
jmp -338
acc +36
acc -19
jmp -192
acc +49
jmp -380
acc -12
acc +14
acc +38
acc +4
jmp -228
acc +2
jmp -197
jmp -41
jmp -265
jmp -113
jmp -459
jmp +1
acc +38
jmp -79
acc +16
nop -456
jmp -129
acc +12
acc +29
nop -575
acc -7
jmp +1