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

Off by one

Browse Source
This commit is contained in:
Bert Peters
2023-12-06 13:34:25 +01:00
parent bfed992b7d
commit d2e1ad50d2
1 changed files with 8 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
2023/src/day06.rs
View File

@@ -54,7 +54,7 @@ fn ways(time: u64, distance: u64) -> u64 {
while min < max { while min < max {
let mid = min + (max - min) / 2; let mid = min + (max - min) / 2;
if mid * (time - mid) < distance { if mid * (time - mid) <= distance {
min = mid + 1; min = mid + 1;
} else { } else {
max = mid; max = mid;
@@ -94,6 +94,13 @@ mod tests {
const SAMPLE: &[u8] = include_bytes!("samples/06.txt"); const SAMPLE: &[u8] = include_bytes!("samples/06.txt");
#[test]
fn individual_samples() {
assert_eq!(ways(7, 9), 4);
assert_eq!(ways(15, 40), 8);
assert_eq!(ways(30, 200), 9);
}
#[test] #[test]
fn sample_part1() { fn sample_part1() {
assert_eq!(part1(SAMPLE).unwrap(), "288"); assert_eq!(part1(SAMPLE).unwrap(), "288");