Started 2020, added day 2020-01 and various utilities

Author: Piratmac

.gitignore

@@ -2,3 +2,4 @@ Inputs/
 template.py
 __pycache__
 parse/
+download.py

2016/24-Air Duct Spelunking.py

@@ -4,50 +4,54 @@
 test_data = {}
 
 test = 1
-test_data[test]   = {"input": """###########
+test_data[test] = {
+    "input": """###########
 #0.1.....2#
 #.#######.#
 #4.......3#
 ###########""",
-                     "expected": ['Unknown', 'Unknown'],
-                    }
-
-test += 1
-test_data[test]   = {"input": """""",
-                     "expected": ['Unknown', 'Unknown'],
-                    }
-
-test = 'real'
-input_file = os.path.join(os.path.dirname(__file__), 'Inputs', os.path.basename(__file__).replace('.py', '.txt'))
-test_data[test] = {"input": open(input_file, "r+").read().strip(),
-                     "expected": ['442', 'Unknown'],
-                    }
+    "expected": ["Unknown", "Unknown"],
+}
+
+test = "real"
+input_file = os.path.join(
+    os.path.dirname(__file__),
+    "Inputs",
+    os.path.basename(__file__).replace(".py", ".txt"),
+)
+test_data[test] = {
+    "input": open(input_file, "r+").read().strip(),
+    "expected": ["442", "660"],
+}
 
 # -------------------------------- Control program execution -------------------------------- #
 
-case_to_test  = 'real'
-part_to_test  = 2
+case_to_test = "real"
+part_to_test = 2
 verbose_level = 1
 
 # -------------------------------- Initialize some variables -------------------------------- #
 
-puzzle_input           = test_data[case_to_test]['input']
-puzzle_expected_result = test_data[case_to_test]['expected'][part_to_test-1]
-puzzle_actual_result   = 'Unknown'
+puzzle_input = test_data[case_to_test]["input"]
+puzzle_expected_result = test_data[case_to_test]["expected"][part_to_test - 1]
+puzzle_actual_result = "Unknown"
 
 
 # -------------------------------- Actual code execution -------------------------------- #
 
 grid = puzzle_input
-graph = pathfinding.WeightedGraph ()
-graph.grid_to_vertices(re.sub('[0-9]', '.', puzzle_input))
+graph = pathfinding.WeightedGraph()
+graph.grid_to_vertices(re.sub("[0-9]", ".", puzzle_input))
 
 waypoints = {}
-for i in range (10):
+for i in range(10):
     if str(i) in grid:
-        waypoints[i] = (grid.find(str(i)) % (len(grid.split('\n')[0])+1), grid.find(str(i)) // (len(grid.split('\n')[0])+1))
+        waypoints[i] = (
+            grid.find(str(i)) % (len(grid.split("\n")[0]) + 1),
+            grid.find(str(i)) // (len(grid.split("\n")[0]) + 1),
+        )
 
-edges = {waypoints[x]:{} for x in waypoints}
+edges = {waypoints[x]: {} for x in waypoints}
 for a in waypoints:
     for b in waypoints:
         if waypoints[a] <= waypoints[b]:
@@ -59,7 +63,7 @@
         edges[waypoints[b]][waypoints[a]] = graph.distance_from_start[waypoints[b]]
         graph.reset_search()
 
-min_length = 10**6
+min_length = 10 ** 6
 for order in itertools.permutations([waypoints[x] for x in waypoints if x != 0]):
     length = 0
     current_waypoint = waypoints[0]
@@ -74,19 +78,9 @@
 puzzle_actual_result = min_length
 
 
-
-
-
-
-
-
 # -------------------------------- Outputs / results -------------------------------- #
 
 if verbose_level >= 3:
-    print ('Input : ' + puzzle_input)
-print ('Expected result : ' + str(puzzle_expected_result))
-print ('Actual result   : '   + str(puzzle_actual_result))
-
-
-
-
+    print("Input : " + puzzle_input)
+print("Expected result : " + str(puzzle_expected_result))
+print("Actual result   : " + str(puzzle_actual_result))

2020/01-Report Repair.py

@@ -0,0 +1,82 @@
+# -------------------------------- Input data ---------------------------------------- #
+import os, grid, graph, dot, assembly, re, itertools, math
+
+from compass import *
+
+
+# This functions come from https://github.com/mcpower/adventofcode - Thanks!
+def lmap(func, *iterables):
+    return list(map(func, *iterables))
+
+
+def ints(s: str):
+    return lmap(int, re.findall(r"-?\d+", s))  # thanks mserrano!
+
+
+def positive_ints(s: str):
+    return lmap(int, re.findall(r"\d+", s))  # t hanks mserrano!
+
+
+def floats(s: str):
+    return lmap(float, re.findall(r"-?\d+(?:\.\d+)?", s))
+
+
+def positive_floats(s: str):
+    return lmap(float, re.findall(r"\d+(?:\.\d+)?", s))
+
+
+def words(s: str):
+    return re.findall(r"[a-zA-Z]+", s)
+
+
+test_data = {}
+
+test = 1
+test_data[test] = {
+    "input": """1721
+979
+366
+299
+675
+1456""",
+    "expected": ["514579", "241861950"],
+}
+
+test = "real"
+input_file = os.path.join(
+    os.path.dirname(__file__),
+    "Inputs",
+    os.path.basename(__file__).replace(".py", ".txt"),
+)
+test_data[test] = {
+    "input": open(input_file, "r+").read(),
+    "expected": ["997899", "131248694"],
+}
+
+# -------------------------------- Control program execution ------------------------- #
+
+case_to_test = "real"
+part_to_test = 2
+
+# -------------------------------- Initialize some variables ------------------------- #
+
+puzzle_input = test_data[case_to_test]["input"]
+puzzle_expected_result = test_data[case_to_test]["expected"][part_to_test - 1]
+puzzle_actual_result = "Unknown"
+
+
+# -------------------------------- Actual code execution ----------------------------- #
+
+values = sorted(ints(puzzle_input))
+
+for a in itertools.combinations(values, part_to_test + 1):
+    if sum(a) == 2020:
+        puzzle_actual_result = math.prod(a)
+        break
+
+
+# -------------------------------- Outputs / results --------------------------------- #
+
+print("Case :", case_to_test, "- Part", part_to_test)
+print("Expected result : " + str(puzzle_expected_result))
+print("Actual result   : " + str(puzzle_actual_result))