mirror of
https://github.com/Crocmagnon/advent-of-code.git
synced 2024-05-18 17:42:52 +02:00
53 lines
1.3 KiB
Python
53 lines
1.3 KiB
Python
from collections import defaultdict
|
|
|
|
|
|
def main(filename: str, expected_part_1: int = None, expected_part_2: int = None):
|
|
print(f"\n+ Running on {filename}")
|
|
with open(filename) as f:
|
|
data = f.read().strip().split("\n")
|
|
|
|
counter_part_1 = solve_part_1(data)
|
|
|
|
print(f"1. Found {counter_part_1}")
|
|
if expected_part_1:
|
|
assert expected_part_1 == counter_part_1
|
|
|
|
counter_part_2 = solve_part_2(data)
|
|
print(f"2. Found {counter_part_2}")
|
|
if expected_part_2:
|
|
assert expected_part_2 == counter_part_2
|
|
|
|
|
|
def solve_part_1(data):
|
|
count_ones = defaultdict(int)
|
|
total = len(data)
|
|
for binary in data:
|
|
for index, digit in enumerate(binary):
|
|
if digit == "1":
|
|
count_ones[index] += 1
|
|
gamma = ""
|
|
epsilon = ""
|
|
for index in range(len(data[0])):
|
|
most_common = _most_common(count_ones, total, index)
|
|
gamma += most_common
|
|
epsilon += "0" if most_common == "1" else "1"
|
|
return int(gamma, 2) * int(epsilon, 2)
|
|
|
|
|
|
def _most_common(count_ones, total, index):
|
|
"""
|
|
Return 1 if the most common value is 1, otherwise 0.
|
|
"""
|
|
if count_ones[index] >= total / 2:
|
|
return "1"
|
|
return "0"
|
|
|
|
|
|
def solve_part_2(data):
|
|
return 0
|
|
|
|
|
|
if __name__ == "__main__":
|
|
main("inputs/day03-test1", expected_part_1=198)
|
|
main("inputs/day03")
|