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

Improve day 22 with Brent's cycle finding

Browse Source
This commit is contained in:
Bert Peters
2020-12-23 18:56:21 +01:00
parent 339be73efc
commit 3cbc401841
2 changed files with 16 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
2020/src/day23.rs
View File

@@ -73,9 +73,11 @@ impl Solution for Day23 {
mod tests {
use super::*;
const SAMPLE: &[u8] = b"389125467";
#[test]
fn sample_part1() {
let sample = [3, 8, 9, 1, 2, 5, 4, 6, 7];
let sample = read_input(&mut SAMPLE.as_ref());
assert_eq!("92658374", &play_game(&mut sample.clone(), 10));
assert_eq!("67384529", &play_game(&mut sample.clone(), 100));
}