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

use super::elfcode::Program;
use crate::input::Input;

pub fn solve(input: &Input) -> Result<u64, String> {
    let mut program = Program::parse(input.text)?;

    if input.is_part_one() {
        return program.execute_until_halt(10_000_000);
    }

    program.registers.values[0] = 1;

    program.optimize();

    if program.instructions.len() < 3 {
        return Err("Too few instructions".to_string());
    }
    let register = program.instructions[2].c as usize;
    if register > 5 {
        return Err("Register outside bounds".to_string());
    }
    while program.registers.values[register] == 0 {
        program.execute_one_instruction()?;
    }

    let mut sum = 0;
    // Assuming number to be factored is highest register value:
    let &seed = program
        .registers
        .values
        .iter()
        .max()
        .ok_or("Internal error: No registers")?;
    for i in 1..=seed {
        if seed % i == 0 {
            sum += i;
        }
    }
    Ok(sum)
}

#[test]
fn tests() {
    test_part_one!(
            "#ip 0
seti 5 0 1
seti 6 0 2
addi 0 1 0
addr 1 2 3
setr 1 0 0
seti 8 0 4
seti 9 0 5" => 7);

    let input = include_str!("day19_input.txt");
    test_part_one!(input => 978);
    test_part_two!(input => 10_996_992);
}