From 6b733982f9f240c1c97f1fa705bfbe4cd93c640e Mon Sep 17 00:00:00 2001
From: mhsn <mail@mhsn.net>
Date: Fri, 12 Sep 2025 20:20:58 +0100
Subject: simplify python file structure

---
 2024/19/python.py             | 42 ++++++++++++++++++++++++++++++++++++++++++
 2024/19/python/main.py        | 40 ----------------------------------------
 2024/19/python/pyproject.toml |  6 ------
 3 files changed, 42 insertions(+), 46 deletions(-)
 create mode 100755 2024/19/python.py
 delete mode 100644 2024/19/python/main.py
 delete mode 100644 2024/19/python/pyproject.toml

(limited to '2024/19')

diff --git a/2024/19/python.py b/2024/19/python.py
new file mode 100755
index 0000000..efd3272
--- /dev/null
+++ b/2024/19/python.py
@@ -0,0 +1,42 @@
+#!/usr/bin/env python3
+
+from fileinput import input
+from functools import cache
+from itertools import takewhile
+
+inp = map(str.strip, input())
+towels = [t.strip() for t in next(takewhile(bool, inp)).split(",")]
+designs = [d for d in inp if d]
+
+# Construct trie
+trie = {}
+for towel in towels:
+    prev = None
+    curr = trie
+    for t in towel:
+        term, succ = curr.setdefault(t, (False, {}))
+        prev = curr
+        curr = succ
+    prev[towel[-1]] = (True, curr)
+
+
+@cache
+def steps(design, n=0):
+    if n == len(design):
+        return 1
+    ways = 0
+    curr = trie
+    for d, s in enumerate(design[n:], start=1):
+        if s not in curr:
+            return ways
+        term, curr = curr[s]
+        if term:
+            ways += steps(design, n + d)
+    return ways
+
+
+silver = sum(map(bool, map(steps, designs)))
+gold = sum(map(steps, designs))
+
+print("silver:", silver)
+print("gold:", gold)
diff --git a/2024/19/python/main.py b/2024/19/python/main.py
deleted file mode 100644
index a41156c..0000000
--- a/2024/19/python/main.py
+++ /dev/null
@@ -1,40 +0,0 @@
-from fileinput import input
-from functools import cache
-from itertools import takewhile
-
-inp = map(str.strip, input())
-towels = [t.strip() for t in next(takewhile(bool, inp)).split(",")]
-designs = [d for d in inp if d]
-
-# Construct trie
-trie = {}
-for towel in towels:
-    prev = None
-    curr = trie
-    for t in towel:
-        term, succ = curr.setdefault(t, (False, {}))
-        prev = curr
-        curr = succ
-    prev[towel[-1]] = (True, curr)
-
-
-@cache
-def steps(design, n=0):
-    if n == len(design):
-        return 1
-    ways = 0
-    curr = trie
-    for d, s in enumerate(design[n:], start=1):
-        if s not in curr:
-            return ways
-        term, curr = curr[s]
-        if term:
-            ways += steps(design, n + d)
-    return ways
-
-
-silver = sum(map(bool, map(steps, designs)))
-gold = sum(map(steps, designs))
-
-print("silver:", silver)
-print("gold:", gold)
diff --git a/2024/19/python/pyproject.toml b/2024/19/python/pyproject.toml
deleted file mode 100644
index 539ef74..0000000
--- a/2024/19/python/pyproject.toml
+++ /dev/null
@@ -1,6 +0,0 @@
-[project]
-name = "aoc-2024-19"
-version = "0.1.0"
-description = "advent of code 2024-19"
-requires-python = ">=3.13"
-dependencies = []
-- 
cgit v1.2.3