refactor(sterni/aoc/2022): use scan in BQN/k

We can actually use one and the same scan on the sorted list
to solve part 1 and 2 of the assignment.

Change-Id: I657a81bad6151ef4fe13239db88d2dbd2f9c29d8
Reviewed-on: https://cl.tvl.fyi/c/depot/+/7491
Autosubmit: sterni <sternenseemann@systemli.org>
Reviewed-by: sterni <sternenseemann@systemli.org>
Tested-by: BuildkiteCI
This commit is contained in:
sterni 2022-12-02 02:53:28 +01:00 committed by clbot
parent 7e122fdcbc
commit 7ffeb4f7f1
2 changed files with 4 additions and 5 deletions

View file

@ -1,7 +1,7 @@
lib •Import •path"/../../lib.bqn"
input lib.ReadDec¨¨ (<"") lib.SplitOn •FLines •path"/input"
cpe +´¨ input
a·b +`3+´¨ input
•Out "day 01.1: "•Fmt ´cpe
•Out "day 01.2: "•Fmt +´3cpe
•Out "day 01.1: "•Fmt a
•Out "day 01.2: "•Fmt b

View file

@ -1,2 +1 @@
/ a better approach is to use the downgraded list for both tasks, as demonstrated by leah2
(|/e),+/e@3#>e:(+/.'1_)'(&0=#'i)_i:0:"input"
(+\e@3#>e:(+/.'1_)'(&0=#'i)_i:0:"input")_1