advent-of-code 2025.5.0

Solutions to Advent of Code
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

use crate::common::array_stack::ArrayStack;
use crate::input::Input;

pub fn solve(input: &Input) -> Result<u32, String> {
    let mut patterns = ArrayStack::<1024, u64>::new();
    let mut result = 0;
    for pattern in input.text.split("\n\n") {
        let pattern = pattern
            .trim_ascii()
            .bytes()
            .enumerate()
            .map(|(i, c)| u64::from(c == b'#') << i)
            .sum();
        for &y in patterns.slice() {
            result += u32::from(pattern & y == 0);
        }
        patterns.push(pattern)?;
    }
    Ok(result)
}

#[test]
pub fn tests() {
    let test_input = "#####
.####
.####
.####
.#.#.
.#...
.....

#####
##.##
.#.##
...##
...#.
...#.
.....

.....
#....
#....
#...#
#.#.#
#.###
#####

.....
.....
#.#..
###..
###.#
###.#
#####

.....
.....
.....
#....
#.#..
#.#.#
#####";
    test_part_one_no_allocations!(test_input => 3);

    let real_input = include_str!("day25_input.txt");
    test_part_one_no_allocations!(real_input => 3107);
}