Gabe/advent-of-code
1
0
Fork 0
Code Activity

formatting and cosmetic updates to 2020.

Browse source
This commit is contained in:
Gabe Venberg 2026-04-17 16:21:34 +02:00
parent 84c4cf9991
commit cd75e58f77
28 changed files with 320 additions and 287 deletions
Download patch file Download diff file Expand all files Collapse all files

35
2020/days/01/day1.py
View file

@ -2,41 +2,43 @@
import pathlib
import sys
import re
from dataclasses import dataclass
def parse(puzzle_input):
"""Parse input"""
return [int(string) for string in puzzle_input.splitlines()]
def part1(data:list[int]):
def part1(data: list[int]):
"""Solve part 1"""
data.sort()
while True:
if len(data)<2:
raise ValueError('no match found')
s = data[0]+data[-1]
if s>2020:
if len(data) < 2:
raise ValueError("no match found")
s = data[0] + data[-1]
if s > 2020:
data.pop(-1)
elif s<2020:
elif s < 2020:
data.pop(0)
else:
return data[0]*data[-1]
return data[0] * data[-1]
def part2(data):
"""Solve part 2"""
data.sort()
while True:
if len(data)<3:
raise ValueError('no match found')
if data[0]+data[1]+data[-1]>2020:
if len(data) < 3:
raise ValueError("no match found")
if data[0] + data[1] + data[-1] > 2020:
data.pop(-1)
elif data[0]+data[-1]+data[-2]<2020:
elif data[0] + data[-1] + data[-2] < 2020:
data.pop(0)
elif data[0]+data[1]+data[-1]==2020:
return data[0]*data[1]*data[-1]
elif data[0] + data[1] + data[-1] == 2020:
return data[0] * data[1] * data[-1]
else:
return data[0]*data[-1]*data[-2]
return data[0] * data[-1] * data[-2]
def solve(puzzle_input):
"""Solve the puzzle for the given input"""
@ -46,6 +48,7 @@ def solve(puzzle_input):
return solution1, solution2
if __name__ == "__main__":
for path in sys.argv[1:]:
print(f"{path}:")