eldridge.cam
Advent of Code solutions
remove extra dbgs
-1
2025/11/p1.tri
-1
2025/11/p1.tri
+5
-6
2025/11/p2.tri
+5
-6
2025/11/p2.tri
···
34
34
35
35
proc main!() {
36
36
let graph = rec::collect <| it::map (parse connection) <| readlines
37
-
dbg!(graph)
38
37
39
38
let paths_between = pathfinder!(graph)
40
39
let dac_fft = paths_between "dac" "fft"
41
40
42
41
if dac_fft == 0 {
43
-
let inner = dbg!(paths_between "fft" "dac")
44
-
let prefix = dbg!(paths_between "svr" "fft")
45
-
let suffix = dbg!(paths_between "dac" "out")
42
+
let inner = paths_between "fft" "dac"
43
+
let prefix = paths_between "svr" "fft"
44
+
let suffix = paths_between "dac" "out"
46
45
dbg!(inner * prefix * suffix)
47
46
} else {
48
-
let prefix = dbg!(paths_between "svr" "dac")
49
-
let suffix = dbg!(paths_between "fft" "out")
47
+
let prefix = paths_between "svr" "dac"
48
+
let suffix = paths_between "fft" "out"
50
49
dbg!(dac_fft * prefix * suffix)
51
50
}
52
51
}