some more days

This commit is contained in:
2025-07-29 20:29:15 +02:00
parent a5a664736d
commit f9abb90915
5 changed files with 228 additions and 0 deletions

40
2022/day2/day2.py Normal file
View File

@@ -0,0 +1,40 @@
def main(content):
table = str.maketrans("XYZ", "ABC")
score = 0
for c in content:
c = c.translate(table)
w = ord(c[-1]) - ord("A") + 1
match c:
case "A A" | "B B" | "C C": score += 3 + w
case "A B" | "B C" | "C A": score += 6 + w
case "A C" | "B A" | "C B": score += w
case _: assert False, c
print("Part 1: ", score)
# x = lose, y = draw, z = win
score = 0
for c in content:
outcome = c[-1]
if outcome == "Y":
w = ord(c[0]) - ord("A") + 1
score += 3 + w
elif outcome == "Z":
index = ord(c[0]) - ord("A")
play = "ABC"[(index + 1) % 3]
w = ord(play) - ord("A") + 1
score += 6 + w
elif outcome == "X":
index = ord(c[0]) - ord("A")
w = ord("ABC"[index - 1]) - ord("A") + 1
score += w
else:
assert False, outcome
print(score)
if __name__ == "__main__":
import fileinput
#main(['A Y', 'B X', 'C Z'])
main(list(l.rstrip() for l in fileinput.input()))

36
2022/day3/day3.py Normal file
View File

@@ -0,0 +1,36 @@
from itertools import zip_longest
from functools import reduce
from operator import and_
def grouper(n, iterable):
"grouper(3, 'ABCDEFG', 'x') --> ABC DEF Gxx"
args = [iter(iterable)] * n
return zip_longest(*args)
def split(x):
return set(x[:len(x)//2]), set(x[len(x)//2:])
def get_priority(x):
x = x.pop()
prio = ord(x)
if "a" <= x <= "z":
prio -= ord("a") - 1
else:
prio -= ord("A") - 27
return prio
def main(content):
total = sum(get_priority(reduce(and_, split(l))) for l in content)
print("Part 1: ", total)
total = sum(get_priority(reduce(and_, map(set, x))) for x in grouper(3, content))
print("Part 2: ", total)
if __name__ == "__main__":
import fileinput
main(list(l.rstrip() for l in fileinput.input()))

45
2022/day4/day4.py Normal file
View File

@@ -0,0 +1,45 @@
def contains(first, second):
"True if first ⊂ second or second ⊂ first"
start_a, end_a = first
start_b, end_b = second
if start_b >= start_a and end_b <= end_a:
return True
start_a, end_a = second
start_b, end_b = first
if start_b >= start_a and end_b <= end_a:
return True
return False
def overlaps(first, second):
start_a, end_a = first
start_b, end_b = second
if start_a <= start_b <= end_a:
return True
if start_b <= start_a <= end_b:
return True
return False
def main(content):
total = 0
for l in content:
first, second = [tuple(map(int, x.split("-"))) for x in l.split(",")]
if contains(first, second):
total += 1
print("Part 1: ", total)
total = 0
for l in content:
first, second = [tuple(map(int, x.split("-"))) for x in l.split(",")]
if overlaps(first, second):
total += 1
print("Part 2: ", total)
if __name__ == "__main__":
import fileinput
main([l.rstrip() for l in fileinput.input()])