commit 35c21e5418209af19c0eeb008aabdbd7f23847ca · aylac.top/advent_of_code

+27 -11

2025/2/rust/src/main.rs

···

       0
        
       
     

       0
        
       
     

       1
        
       struct Range {

     

       2
        
           start: u64,

     

       3
        
           end: u64,

     

       4
        
       }

     

       0
        
       
     

       0
        
       
     

       5
        
       

     

       6
        
       fn main() {

     

       7
        
           let input: Vec<Range> = include_str!("../../input.txt")

     
···

       19
        
               })

     

       20
        
               .collect();

     

       21
        
       

     

       22
       -
           let powers_of_ten: Vec<u64> = (0..10).map(|i| 10_u64.pow(i)).collect();

     

       23
        
       

     

       24
        
           let part_1 = input.iter().fold(0_u64, |acc, v| {

     

       25
        
               (v.start..=v.end).fold(acc, |acc, n| {

     
···

       39
        
           });

     

       40
        
           println!("{}", part_1);

     

       41
        
       

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       42
        
           let part_2 = input.iter().fold(0_u64, |acc, v| {

     

       43
       -
               (v.start..=v.end).fold(acc, |acc, n| {

     

       44
       -
                   if n <= 10 {

     

       45
        
                       return acc;

     

       46
        
                   }

     

       47
       -
                   let len = (n.ilog10() + 1) as usize;

     

       48
       -
                   match (1..=len / 2).rfind(|clen| {

     

       49
       -
                       let num = n % powers_of_ten.get(*clen).unwrap();

     

       50
       -
                       let res = (0..len / clen)

     

       51
       -
                           .fold(0, |acc, i| acc + num * powers_of_ten.get(i * clen).unwrap());

     

       52
       -
                       res == n

     

       53
       -
                   }) {

     

       54
       -
                       Some(_) => acc + n,

     

       55
        
                       _ => acc,

     

       56
        
                   }

     

       57
        
               })

···

       1
       +
       use std::collections::HashSet;

     

       2
       +
       

     

       3
        
       struct Range {

     

       4
        
           start: u64,

     

       5
        
           end: u64,

     

       6
        
       }

     

       7
       +
       

     

       8
       +
       const MAX_LENGTH: usize = 10;

     

       9
        
       

     

       10
        
       fn main() {

     

       11
        
           let input: Vec<Range> = include_str!("../../input.txt")

     
···

       23
        
               })

     

       24
        
               .collect();

     

       25
        
       

     

       26
       +
           let powers_of_ten: Vec<u64> = (0..=MAX_LENGTH as u32).map(|i| 10_u64.pow(i)).collect();

     

       27
        
       

     

       28
        
           let part_1 = input.iter().fold(0_u64, |acc, v| {

     

       29
        
               (v.start..=v.end).fold(acc, |acc, n| {

     
···

       43
        
           });

     

       44
        
           println!("{}", part_1);

     

       45
        
       

     

       46
       +
           let mut part_2_invalid: HashSet<u64> = HashSet::new();

     

       47
       +
           for len in 1..=MAX_LENGTH / 2 {

     

       48
       +
               // 1-9, 10-99, 100-999, 100000-999999

     

       49
       +
               for combination in

     

       50
       +
                   *powers_of_ten.get(len - 1).unwrap_or(&1)..*powers_of_ten.get(len).unwrap()

     

       51
       +
               {

     

       52
       +
                   let mut number = 0;

     

       53
       +
                   // 0 is just the number (9), 1 is one repetition (99)

     

       54
       +
                   for repeat in 0..MAX_LENGTH / len {

     

       55
       +
                       number += combination * powers_of_ten.get((len * repeat) as usize).unwrap();

     

       56
       +
                       if repeat > 0 {

     

       57
       +
                           part_2_invalid.insert(number);

     

       58
       +
                       }

     

       59
       +
                   }

     

       60
       +
               }

     

       61
       +
           }

     

       62
       +
           let part_2_invalid = part_2_invalid;

     

       63
       +
       

     

       64
        
           let part_2 = input.iter().fold(0_u64, |acc, v| {

     

       65
       +
               (v.start..=v.end).fold(acc, |acc, num| {

     

       66
       +
                   if num <= 10 {

     

       67
        
                       return acc;

     

       68
        
                   }

     

       69
       +
                   match part_2_invalid.get(&num) {

     

       70
       +
                       Some(_) => acc + num,

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       71
        
                       _ => acc,

     

       72
        
                   }

     

       73
        
               })