formatting

Author: Viliam Pucik

2015/11.py

@@ -14,7 +14,9 @@ def solve(password):
 
         for suffix in product(letters[letters.index(password[-i]) + 1 :], *([letters] * (i - 1))):
             candidate = prefix + "".join(suffix)
-            if r.search(candidate) and any(candidate[j : j + 3] in triplets for j in range(len(candidate) - 2)):
+            if r.search(candidate) and any(
+                candidate[j : j + 3] in triplets for j in range(len(candidate) - 2)
+            ):
                 found = candidate
                 break
 

2020/04.py

@@ -2,6 +2,7 @@
 import sys
 import re
 
+# fmt:off
 fields = {
     "byr": lambda x: 1920 <= int(x) <= 2002,
     "iyr": lambda x: 2010 <= int(x) <= 2020,
@@ -11,7 +12,7 @@
     "ecl": lambda x: x in ("amb", "blu", "brn", "gry", "grn", "hzl", "oth"),
     "pid": lambda x: re.fullmatch(r"\d{9}", x),
 }
-
+# fmt:on
 present = 0
 valid = 0
 

2020/19.py

@@ -2,6 +2,7 @@
 import sys
 import regex
 
+
 # Kudos to https://github.com/taddeus/advent-of-code/blob/master/2020/19_regex.py
 def solve(rules, messages):
     def expand(value):

2021/12.py

@@ -9,6 +9,7 @@
     caves[a].append(b)
     caves[b].append(a)
 
+
 # Recursive version with result caching
 @cache
 def dfs(parent, lowers, duplicate):
@@ -21,15 +22,21 @@ def dfs(parent, lowers, duplicate):
             duplicate = True
         lowers |= {parent}
 
-    return sum(dfs(child, frozenset(lowers), duplicate) for child in caves[parent] if child != "start")
+    return sum(
+        dfs(child, frozenset(lowers), duplicate) for child in caves[parent] if child != "start"
+    )
 
 
 for duplicate in True, False:
     print(dfs("start", frozenset(), duplicate))
 
 # Slightly slower, non recursive version with result caching
 for duplicate in True, False:
-    count, search, cache = 0, deque((child, frozenset(), duplicate, None) for child in caves["start"]), {}
+    count, search, cache = (
+        0,
+        deque((child, frozenset(), duplicate, None) for child in caves["start"]),
+        {},
+    )
 
     while search:
         parent, lowers, duplicate, start = search.popleft()
@@ -54,6 +61,10 @@ def dfs(parent, lowers, duplicate):
                 duplicate = True
             lowers |= {parent}
 
-        search.extendleft((child, frozenset(lowers), duplicate, None) for child in caves[parent] if child != "start")
+        search.extendleft(
+            (child, frozenset(lowers), duplicate, None)
+            for child in caves[parent]
+            if child != "start"
+        )
 
     print(count)

2021/15.py

@@ -33,4 +33,8 @@
         yd, ym = divmod(y, width)
         data["weight"] = (m[xm][ym] + xd + yd - 1) % 9 + 1
 
-    print(nx.shortest_path_length(g, source=(0, 0), target=(i * height - 1, i * width - 1), weight="weight"))
+    print(
+        nx.shortest_path_length(
+            g, source=(0, 0), target=(i * height - 1, i * width - 1), weight="weight"
+        )
+    )

2022/14.py

@@ -2,6 +2,7 @@
 from itertools import pairwise
 from collections import deque
 
+
 # Kudos to https://www.reddit.com/r/adventofcode/comments/zli1rd/comment/j061f6z
 def solve(check, path=deque([500])):
     while True: