decision trees

Cargo.toml

@@ -35,7 +35,7 @@ members = [
     "advent-of-code-2023/d03-gear-ratios",
     "advent-of-code-2023/d04-scratchcards",
     "advent-of-code-2023/d05-if-you-give-a-seed-a-fertilizer",
-    "advent-of-code-2023/d06",
+    "advent-of-code-2023/d06-wait-for-it",
     "advent-of-code-2023/d07-camel-cards",
     "advent-of-code-2023/d08-haunted-wasteland",
     "advent-of-code-2023/d09",

advent-of-code-2023/README.md

@@ -22,14 +22,24 @@ Iterators
 
 ### [Day 4](day4/README.md)
 
+Novel algorithm
+
 ### [Day 5](day5/README.md)
 
+Ranges, Maps
+
 ### [Day 6](day6/README.md)
 
+Quadratic Formula
+
 ### [Day 7](day7/README.md)
 
+Decisions Trees
+
 ### [Day 8](day8/README.md)
 
+Graph, LCM
+
 ### [Day 9](day9/README.md)
 
 ### [Day 10](day10/README.md)

advent-of-code-2023/d06/Cargo.toml → advent-of-code-2023/d06-wait-for-it/Cargo.toml

@@ -6,3 +6,4 @@ edition = "2021"
 # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
 
 [dependencies]
+aoc = { path = "../../aoc" }

advent-of-code-2023/d06-wait-for-it/src/main.rs

@@ -0,0 +1,17 @@
+fn brute_force(time: i64, distance: i64) -> u64 {
+    (0..time).filter(|&t| t * (time - t) > distance).count() as u64
+}
+
+fn part1(inputs: impl Iterator<Item = (i64, i64)>) -> u64 {
+    inputs
+        .map(|(time, distance)| brute_force(time, distance))
+        .product::<u64>()
+}
+
+fn main() {
+    let input_one = &[(61, 430), (67, 1036), (75, 1307), (71, 1150)];
+    let input_two = (61677571, 430103613071150);
+
+    println!("Part 1: {}", part1(input_one.iter().copied()));
+    println!("Part 2: {}", brute_force(input_two.0, input_two.1));
+}