We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 7b9ee17 commit bc31c7cCopy full SHA for bc31c7c
src/bin/2025_11/main.rs
@@ -45,7 +45,7 @@ fn solve<const PART: usize>(input: &str) -> usize {
45
if PART == 1 {
46
path_count("you", "out", &map, &mut cache)
47
} else {
48
- // Assuming there are no cycles, there can only be a path from fft to dac or dac to fft
+ // Assuming there are no cycles, there can only be paths from fft to dac or dac to fft
49
let paths_fft_dac = path_count("fft", "dac", &map, &mut cache);
50
cache.clear();
51
let paths_dac_fft = path_count("dac", "fft", &map, &mut cache);
0 commit comments