Added a few advent of code solutions

14 files changed, 360 insertions, 0 deletions

diff --git a/samples/aoc/2015/01/input b/samples/aoc/2015/01/input
new file mode 100644
index 0000000..4b58722
--- /dev/null
+++ b/samples/aoc/2015/01/input
@@ -0,0 +1 @@
+()())
diff --git a/samples/aoc/2015/01/solve.bruijn b/samples/aoc/2015/01/solve.bruijn
new file mode 100644
index 0000000..da7c87d
--- /dev/null
+++ b/samples/aoc/2015/01/solve.bruijn
@@ -0,0 +1,10 @@
+:import std/List .
+:import std/Number .
+:import std/Char C
+
+walk scanl floor (+0)
+	floor [[(C.eq? 0 '(') ++1 --1]]
+
+main [parts (walk instructions)]
+	instructions init 0
+	parts [(last 0) : (find-index <?‣ 0)]
diff --git a/samples/aoc/2016/01/input b/samples/aoc/2016/01/input
new file mode 100644
index 0000000..bb9f2a2
--- /dev/null
+++ b/samples/aoc/2016/01/input
@@ -0,0 +1 @@
+R5,L5,R5,R3
diff --git a/samples/aoc/2016/01/solve.bruijn b/samples/aoc/2016/01/solve.bruijn
new file mode 100644
index 0000000..525d311
--- /dev/null
+++ b/samples/aoc/2016/01/solve.bruijn
@@ -0,0 +1,31 @@
+# vim first: :s/ //g
+
+:import std/Combinator .
+:import std/Char C
+:import std/String S
+:import std/Pair P
+:import std/Number .
+:import std/List .
+
+direction! [^0 : (S.number! ~0)] ⧗ (List Char) → Direction
+
+:test (direction! "R42") ('R' : (+42))
+
+# north=0, east=1, south=2, west=3
+# rotation : (x : y)
+start ((+0) : ((+0) : (+0))) ⧗ State
+
+move [[go ((C.eq? ^0 'R' ++‣ --‣) ^1)]] ⧗ State → Direction → State
+	go [0 : (even? 0 y x)]
+		x (^(~2) + (p ~1)) : ~(~2)
+			p ((0 % (+4)) =? (+3)) -‣ [0]
+		y ^(~2) : (~(~2) + (p ~1))
+			p ((0 % (+4)) =? (+2)) -‣ [0]
+
+:test (move start (direction! "R42")) ((+1) : ((+42) : (+0)))
+
+part1 (P.uncurry …+…) ∘ ~‣ ∘ (foldl move start) ⧗ (List Direction) → State
+
+main [parts coords]
+	coords direction! <$> (split-list-by [C.eq? 0 ','] (init 0))
+	parts [(part1 0)]
diff --git a/samples/aoc/2017/01/input b/samples/aoc/2017/01/input
new file mode 100644
index 0000000..8f237ab
--- /dev/null
+++ b/samples/aoc/2017/01/input
@@ -0,0 +1 @@
+12131415
diff --git a/samples/aoc/2017/01/solve.bruijn b/samples/aoc/2017/01/solve.bruijn
new file mode 100644
index 0000000..dac0ed6
--- /dev/null
+++ b/samples/aoc/2017/01/solve.bruijn
@@ -0,0 +1,23 @@
+:import std/Combinator .
+:import std/String .
+:import std/Number .
+:import std/Char C
+:import std/Pair P
+
+self [[((zip 0) ∘ (drop 1) ∘ cycle) 0]] ⧗ Number → (List Number) → (List (Pair Number Number))
+
+part1 sum ∘ eqs ∘ pairs
+	sum foldl [[^0 + 1]] (+0)
+	eqs filter (P.uncurry …=?…)
+	pairs self (+1)
+
+part2 [(sum ∘ eqs ∘ pairs) 0]
+	sum foldl [[^0 + 1]] (+0)
+	eqs filter (P.uncurry …=?…)
+	pairs self /²(length 0)
+
+:test (part1 ((+1) : ((+1) : ((+2) : {}(+2))))) ((+3))
+
+main [parts nums]
+	nums C.number! <$> ^(lines 0)
+	parts [(part1 0) : (part2 0)]
diff --git a/samples/aoc/2018/01/input b/samples/aoc/2018/01/input
new file mode 100644
index 0000000..78cd296
--- /dev/null
+++ b/samples/aoc/2018/01/input
@@ -0,0 +1,5 @@
++7
++7
+-2
+-7
+-4
diff --git a/samples/aoc/2018/01/solve.bruijn b/samples/aoc/2018/01/solve.bruijn
new file mode 100644
index 0000000..cb47892
--- /dev/null
+++ b/samples/aoc/2018/01/solve.bruijn
@@ -0,0 +1,15 @@
+:import std/Combinator .
+:import std/String .
+:import std/Math .
+:import std/Set S
+
+part1 ∑‣ ⧗ (List FrequencyDiff) → Frequency
+
+part2 z [[[[rec]]]] S.empty (+0) ⧗ (List FrequencyDiff) → Frequency
+	rec (S.has? 1 2) case-end case-cont
+		case-cont 3 (S.add 1 2) (1 + ^0) ~0
+		case-end 1
+
+main [parts nums]
+	nums signed-number! <$> (init (lines 0))
+	parts [(part1 0) : (part2 (cycle 0))]
diff --git a/samples/aoc/2019/01/input b/samples/aoc/2019/01/input
new file mode 100644
index 0000000..f620e23
--- /dev/null
+++ b/samples/aoc/2019/01/input
@@ -0,0 +1,4 @@
+12
+14
+1969
+100756
diff --git a/samples/aoc/2019/01/solve.bruijn b/samples/aoc/2019/01/solve.bruijn
new file mode 100644
index 0000000..518d198
--- /dev/null
+++ b/samples/aoc/2019/01/solve.bruijn
@@ -0,0 +1,27 @@
+:import std/Combinator .
+:import std/Logic .
+:import std/String .
+:import std/Math .
+
+fuel [/³*0 - (+2)] ⧗ Mass → Fuel
+
+:test ((fuel (+12)) =? (+2)) (true)
+:test ((fuel (+14)) =? (+2)) (true)
+:test ((fuel (+1969)) =? (+654)) (true)
+:test ((fuel (+100756)) =? (+33583)) (true)
+
+fuelfuel z [[rec]] ⧗ Mass → Fuel
+	rec go (fuel 0)
+		go [>?0 (0 + (2 0)) (+0)]
+
+:test ((fuelfuel (+14)) =? (+2)) (true)
+:test ((fuelfuel (+1969)) =? (+966)) (true)
+:test ((fuelfuel (+100756)) =? (+50346)) (true)
+
+part1 ∑‣ ∘ (map fuel) ⧗ (List Mass) → Fuel
+
+part2 ∑‣ ∘ (map fuelfuel) ⧗ (List Mass) → Fuel
+
+main [parts nums]
+	nums number! <$> ~(<~>(lines 0))
+	parts [(part1 0) : (part2 0)]
diff --git a/samples/aoc/2020/01/input b/samples/aoc/2020/01/input
new file mode 100644
index 0000000..e3fb011
--- /dev/null
+++ b/samples/aoc/2020/01/input
@@ -0,0 +1,6 @@
+1721
+979
+366
+299
+675
+1456
diff --git a/samples/aoc/2020/01/solve.bruijn b/samples/aoc/2020/01/solve.bruijn
new file mode 100644
index 0000000..39bfcbc
--- /dev/null
+++ b/samples/aoc/2020/01/solve.bruijn
@@ -0,0 +1,22 @@
+# TODO: While this obviously isn't the most performant solution, it should still
+#       be a lot faster than it currently is. I think there's some problem with
+#       underlying strictness/laziness
+
+:import std/Combinator .
+:import std/String .
+:import std/Math .
+:import std/Pair P
+
+part1 z [[rec]]
+	rec ((P.uncurry …+… ^0) =? (+2020)) case-done case-cont
+		case-done P.uncurry …⋅… ^0
+		case-cont 1 ~0
+
+part2 z [[rec]]
+	rec (∑(^0) =? (+2020)) case-done case-cont
+		case-done ∏(^0)
+		case-cont 1 ~0
+
+main [parts nums]
+	nums number! <$> ~(<~>(lines 0))
+	parts [(part1 (cross 0 0)) : (part2 (cross3 0 0 0))]
diff --git a/samples/aoc/2021/01/input b/samples/aoc/2021/01/input
new file mode 100644
index 0000000..f522f3f
--- /dev/null
+++ b/samples/aoc/2021/01/input
@@ -0,0 +1,200 @@
+1227
+1065
+329
+1063
+1889
+1700
+1805
+1373
+389
+1263
+1276
+1136
+1652
+1981
+1406
+1249
+1197
+1379
+1050
+1791
+1703
+2001
+1842
+1707
+1486
+1204
+1821
+1807
+1712
+1871
+1599
+1390
+1219
+1612
+1980
+1857
+1511
+1702
+1455
+1303
+1052
+1754
+1545
+1488
+1848
+1236
+1549
+1887
+1970
+1123
+1686
+1404
+1688
+1106
+1296
+401
+1829
+1693
+1389
+1957
+914
+1176
+1348
+1275
+1624
+1401
+1045
+1396
+1352
+1569
+1060
+1235
+1679
+1503
+1340
+1872
+1410
+1077
+958
+1681
+1189
+1466
+1087
+1852
+1293
+1139
+1300
+1323
+661
+1388
+1983
+1325
+1112
+1774
+1858
+1785
+1616
+1255
+1198
+1354
+1124
+1834
+1417
+1918
+1496
+33
+1150
+1861
+1172
+2006
+1199
+1558
+1919
+1620
+1613
+1710
+1477
+1592
+1709
+1909
+1670
+1922
+1840
+1768
+1982
+1193
+1736
+1877
+1770
+1191
+1433
+1072
+1148
+1225
+1147
+1171
+1424
+1913
+1228
+1339
+1814
+1504
+1251
+1240
+1272
+1500
+1927
+1428
+1641
+1453
+1729
+1976
+1808
+1180
+1024
+1108
+1085
+1669
+1636
+1005
+1520
+1929
+1626
+1551
+1234
+1988
+1256
+1524
+1571
+1506
+1977
+1749
+1408
+1540
+1934
+1810
+1328
+1910
+1478
+1600
+1699
+1413
+1446
+1798
+1013
+1998
+1661
+1058
+1051
+1220
+1447
+1675
+1912
+1668
+1932
+1962
+1055
+1757
+1116
+1090
diff --git a/samples/aoc/2021/01/solve.bruijn b/samples/aoc/2021/01/solve.bruijn
new file mode 100644
index 0000000..d48acff
--- /dev/null
+++ b/samples/aoc/2021/01/solve.bruijn
@@ -0,0 +1,14 @@
+:import std/Math .
+:import std/String .
+
+part1 [{ [[(1 <? 0) (+1) (+0)]] | 0 , ~0 }]
+
+part2 [{ [[(1 <? 0) (+1) (+0)]] | 0 , ~(~(~0)) }]
+
+main [parts nums]
+	nums number! <$> (lines 0)
+	parts [∑(part1 0) : ∑(part2 0)]
+
+# equivalent alternative using std/Pair P
+# part1 [length (filter (P.uncurry …<?…) (zip 0 ~0))]
+# part2 [length (filter (P.uncurry …<?…) (zip 0 ~(~(~0))))]