daviddoji/Advent_of_code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Solution to problem 19 part 2 in Python

Browse Source
This commit is contained in:
David Doblas Jiménez 2022-01-17 20:28:14 +01:00
parent 092c9683d9
commit 1bc00c12fe
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/Year_2020/P19.py
View File

@ -89,7 +89,7 @@ with open("files/P19.txt", "r") as f:
rules, messages = [f.split("\n") for f in f.read().strip().split("\n\n")] rules, messages = [f.split("\n") for f in f.read().strip().split("\n\n")]
def dfs(tree: dict[int, int], node: str, depth: int) -> str: def dfs(tree, node, depth):
if depth > 15: if depth > 15:
return "" return ""
rule = "" rule = ""
@ -103,7 +103,7 @@ def dfs(tree: dict[int, int], node: str, depth: int) -> str:
return "(" + rule + ")" return "(" + rule + ")"
def part_1() -> None: def part_1():
rules_dict = dict([rule.split(": ") for rule in rules]) rules_dict = dict([rule.split(": ") for rule in rules])
rule_0 = re.compile(dfs(rules_dict, "0", 0)) rule_0 = re.compile(dfs(rules_dict, "0", 0))
total = sum([1 for message in messages if rule_0.fullmatch(message)]) total = sum([1 for message in messages if rule_0.fullmatch(message)])