brulijam/Advent_of_Code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

aoc 2023 02

Browse Source
This commit is contained in:
Julian Brammer 2023-12-02 18:20:59 +01:00
parent 64237b431a
commit 5183ae11b8
1 changed files with 33 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
2023/02/main.py
View File

@ -14,7 +14,7 @@ for line in range(len(file)):
blue_pos = set.find(" b") blue_pos = set.find(" b")
positions = [red_pos, green_pos, blue_pos] positions = [red_pos, green_pos, blue_pos]
vals = [0, 0, 0] vals = [0, 0, 0]
for pos in range(len(positions)): for pos in range(len(positions)):
if positions[pos] != -1: if positions[pos] != -1:
vals[pos] = int(set[positions[pos]-2:positions[pos]]) vals[pos] = int(set[positions[pos]-2:positions[pos]])
@ -24,4 +24,35 @@ for line in range(len(file)):
if possible: if possible:
sum += line+1 sum += line+1
print(sum) print("Part 1: " + str(sum))
#! Part 2
file = open("input.txt").readlines()
sum = 0
for line in range(len(file)):
game = file[line].split(";")
game_sum = 0
max_vals = [0, 0, 0]
for set in game:
red_pos = set.find(" r")
green_pos = set.find(" g")
blue_pos = set.find(" b")
positions = [red_pos, green_pos, blue_pos]
vals = [0, 0, 0]
for pos in range(len(positions)):
if positions[pos] != -1:
vals[pos] = int(set[positions[pos]-2:positions[pos]])
for i in range(len(max_vals)):
if vals[i] > max_vals[i]:
max_vals[i] = vals[i]
game_sum += max_vals[0] * max_vals[1] * max_vals[2]
sum += game_sum
print("Part 2: " + str(sum))