day 19 part 1

src/day19.rs

@@ -0,0 +1,73 @@
+use std::{collections::HashSet, fs::read_to_string};
+
+pub fn day_main() {
+    let input = read_to_string("input/day19.txt").unwrap();
+    let input = input.trim();
+    println!(" part1: {}", part1(input));
+    println!(" part2: {}", part2(input));
+}
+
+type RiddleResult = usize;
+
+fn part1(input: &str) -> RiddleResult {
+    let (a, b) = input.split_once("\n\n").unwrap();
+    let towels: HashSet<&str> = a.split(", ").collect();
+    b.lines().filter(|line| possible(line, &towels)).count()
+}
+
+fn possible(line: &str, towels: &HashSet<&str>) -> bool {
+    if line.is_empty() {
+        return true;
+    }
+    for t in towels.iter() {
+        if let Some(suffix) = line.strip_prefix(t) {
+            if possible(suffix, towels) {
+                return true;
+            }
+        }
+    }
+    false
+}
+
+fn part2(_input: &str) -> RiddleResult {
+    0
+}
+
+#[cfg(test)]
+mod test {
+    use std::collections::HashSet;
+
+    use regex::bytes::SetMatchesIntoIter;
+
+    use crate::day19::possible;
+
+    use super::{part1, part2};
+
+    const TEST_INPUT: &str = r"r, wr, b, g, bwu, rb, gb, br
+
+brwrr
+bggr
+gbbr
+rrbgbr
+ubwu
+bwurrg
+brgr
+bbrgwb
+";
+
+    #[test]
+    fn test1() {
+        assert_eq!(part1(TEST_INPUT), 6);
+    }
+
+    #[test]
+    fn solver() {
+        let set = HashSet::from_iter(["r", "wr", "b", "g", "bwu", "rb", "gb", "br"]);
+        assert!(possible("bwurrg", &set));
+    }
+
+    #[test]
+    fn test2() {
+        assert_eq!(part2(TEST_INPUT), 0);
+    }
+}