kageru/advent-of-code
1
0
Fork 0
Code Issues 1 Pull Requests Releases Wiki Activity

remove lcm

This commit is contained in:
kageru 2022-12-11 21:40:07 +01:00
parent 1cfc30921f
commit bd3d070049
Signed by: kageru
GPG Key ID: 8282A2BEA4ADA3D2
1 changed files with 2 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
2022/src/bin/day11.rs
View File

@ -40,20 +40,6 @@ fn parse_input(raw: &str) -> Parsed {
.collect()
}
// Stolen from my 2019 day 12 solution
fn lcm(x: usize, y: usize) -> usize {
fn gcd(mut x: usize, mut y: usize) -> usize {
let mut remainder;
while y != 0 {
remainder = x % y;
x = y;
y = remainder;
}
x
}
x * y / gcd(x, y)
}
fn part1(parsed: &Parsed) -> usize {
monkey_business::<20, 3>(parsed)
}
@ -63,8 +49,8 @@ fn part2(parsed: &Parsed) -> usize {
}
fn monkey_business<const ITERATIONS: usize, const STRESS_REDUCTION: usize>(parsed: &Parsed) -> usize {
let lcm = parsed.iter().map(|m| m.div_test).reduce(lcm).unwrap();
println!("lcm: {lcm}");
// The checks are all prime numbers, so the lcm is just their product.
let lcm = parsed.iter().map(|m| m.div_test).product();
let mut monkeys: Vec<Monkey> = parsed.clone();
let mut moved = Vec::new();
for _ in 0..ITERATIONS {