bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity

Clean up.

Browse Source
This commit is contained in:
Bert Peters
2018-12-14 11:48:48 +01:00
parent f4a7b06d47
commit 5c4646b323
1 changed files with 6 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
2018/src/day14.rs
View File

@@ -8,15 +8,14 @@ fn skill_after(n: usize) -> u64 {
let mut elves = [0, 1];
while state.len() < n + 10 {
let result: u8 = elves.iter().map(|x| state[*x]).sum();
let result = state[elves[0]] + state[elves[1]];
if result >= 10 {
state.push(result / 10);
}
state.push(result % 10);
for elf in elves.iter_mut() {
*elf = (*elf + state[*elf] as usize + 1) % state.len();
}
elves[0] = (elves[0] + state[elves[0]] as usize + 1) % state.len();
elves[1] = (elves[1] + state[elves[1]] as usize + 1) % state.len();
}
let mut skill = 0;
@@ -36,14 +35,13 @@ fn update_current(mut current: usize, by: usize, base: usize) -> usize {
}
fn find_first(n: usize, len: usize) -> usize {
println!("{} {}", n, len);
let mut state = vec![3u8, 7];
let mut elves = [0, 1];
let mut current = 37;
let mod_base = 10usize.pow(len as u32);
loop {
let result: u8 = elves.iter().map(|x| state[*x]).sum();
let result = state[elves[0]] + state[elves[1]];
if result >= 10 {
current = update_current(current, result as usize / 10, mod_base);
if current == n {
@@ -57,9 +55,8 @@ fn find_first(n: usize, len: usize) -> usize {
}
state.push(result % 10);
for elf in elves.iter_mut() {
*elf = (*elf + state[*elf] as usize + 1) % state.len();
}
elves[0] = (elves[0] + state[elves[0]] as usize + 1) % state.len();
elves[1] = (elves[1] + state[elves[1]] as usize + 1) % state.len();
}
}