2022 2b solved

2022/day2/2a.py

@@ -0,0 +1,36 @@
+lines = [i for i in open("input.txt", 'r').read().splitlines()]
+
+sum = 0
+sum2 = 0
+
+for l in lines:
+    match(l):
+        case "A X":
+            sum += 4
+            sum2 += 3
+        case "A Y":
+            sum += 8
+            sum2 += 4
+        case "A Z":
+            sum += 3
+            sum2 += 8
+        case "B X":
+            sum += 1
+            sum2 += 1
+        case "B Y":
+            sum += 5
+            sum2 += 5
+        case "B Z":
+            sum += 9
+            sum2 += 9
+        case "C X":
+            sum += 7
+            sum2 += 2
+        case "C Y":
+            sum += 2
+            sum2 += 6
+        case "C Z": 
+            sum += 6
+            sum2 += 7
+print(sum)
+print(sum2)

2022/day2/input.txt.sample

@@ -0,0 +1,3 @@
+A Y
+B X
+C Z

2023/day1/1a.py

@@ -0,0 +1,20 @@
+lines = [i for i in open("input.txt", 'r').read().splitlines()]
+
+sum = 0
+
+for l in lines:
+    first = ""
+    firstFound = False
+    last = ""
+    lastFound = False
+    for i in range(len(l)):
+        if not firstFound and l[i].isnumeric():
+            first = l[i]
+            firstFound = True
+        if not lastFound and l[-i-1].isnumeric():
+            last = l[-i-1]
+            lastFound = True
+        if firstFound and lastFound:
+            continue
+    sum += int(first + last)
+print(sum)

2023/day1/1b.py

@@ -0,0 +1,32 @@
+lines = [i for i in open("input.txt", 'r').read().splitlines()]
+
+sum = 0
+words = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
+
+for l in lines:
+    first = ""
+    firstFound = False
+    last = ""
+    lastFound = False
+    n = len(l)
+    for i in range(n):
+        if not firstFound and l[i].isnumeric():
+            first = l[i]
+            firstFound = True
+        if not lastFound and l[-i-1].isnumeric():
+            last = l[-i-1]
+            lastFound = True
+        for j in range(len(words)):
+            m = len(words[j])
+            if not firstFound and l[i:i+m] == words[j]:
+                first = str(j)
+                firstFound = True
+            if not lastFound and l[-(i+m):n-i] == words[j]:
+                last = str(j)
+                lastFound = True
+        if firstFound and lastFound:
+            break
+    s = first + last
+    sum += int(s)
+
+print(sum)

2023/day1/input.txt.sample

@@ -0,0 +1,7 @@
+two1nine
+eightwothree
+abcone2threexyz
+xtwone3four
+4nineeightseven2
+zoneight234
+7pqrstsixteen

README.md

@@ -1,10 +1,11 @@
 my solutions for the [Advent of Code](https://adventofcode.com/)
 
 in progress:\
-2021 (python)
+2021: 12/25\
+2022: 1/25\
+2023: 1/25
 
 planned:\
-2022 (rust)\
 2020\
 2019\
 2018\