2024 11-13

Author: rileythomp

2024/11/main.py

@@ -0,0 +1,72 @@
+import sys
+
+data = open(sys.argv[1]).read().strip()
+lines = data.split('\n')
+
+stones = [int(n) for n in lines[0].split()]
+
+for i in range(25):
+    new_stones = []
+    for j, stone in enumerate(stones):
+        if stone == 0:
+            new_stones.append(1)
+        elif len(str(stone)) % 2 == 0:
+            left_half = int(str(stone)[:len(str(stone))//2])
+            right_half = int(str(stone)[len(str(stone))//2:])
+            new_stones.append(left_half)
+            new_stones.append(right_half)
+        else:
+            new_stones.append(stone*2024)
+    stones = new_stones
+print(len(stones))
+
+stones = [(int(n), 0) for n in lines[0].split()]
+print(stones)
+ans = 0
+blinks = 75
+while len(stones) > 0:
+    stone, depth = stones.pop(0)
+    assert (depth <= blinks)
+    if depth == blinks:
+        ans += 1
+        continue
+    if stone == 0:
+        if depth + 4 > blinks:
+            stones.append((1, depth+1))
+        else:
+            new_num = str(2024)
+            for n in new_num:
+                stones.append((int(n), depth+4))
+    elif len(str(stone)) % 2 == 0:
+        curcount = 0
+        curlen = len(str(stone))
+        while curlen % 2 == 0 and curcount+depth < blinks:
+            curlen = curlen//2
+            curcount += 1
+        new_nums_len = len(str(stone))//(2**curcount)
+        new_nums = [str(stone)[i:i+new_nums_len] for i in range(0, len(str(stone)), new_nums_len)]
+        for new_num in new_nums:
+            stones.append((int(new_num), depth+curcount))
+    else:
+        if (1 <= stone <= 4) and depth <= blinks-3:
+            new_num = str(2024*stone)
+            assert (len(new_num) == 4)
+            for n in new_num:
+                stones.append((int(n), depth+3))
+        elif stone in [5, 6, 7, 9] and depth <= blinks-5:
+            new_num = str(stone*2024*2024)
+            assert (len(new_num) == 8)
+            for n in new_num:
+                stones.append((int(n), depth+5))
+        elif stone == 8 and depth <= blinks-5:
+            new_stones = [3, 2, 7, 7, 2, 6]
+            for n in new_stones:
+                stones.append((n, depth+5))
+            stones.append((8, depth+4))
+        else:
+            new_num = str(stone*2024)
+            new_depth = depth+1
+
+            stones.append((stone*2024, depth+1))
+
+print(ans)

2024/12/main.py

@@ -0,0 +1,85 @@
+import sys
+
+data = open(sys.argv[1]).read().strip()
+lines = data.split('\n')
+
+grid = [list(line) for line in lines]
+
+seen = set()
+regions = []
+
+nbrs = [(-1, 0), (0, 1), (1, 0), (0, -1)]
+
+for y, row in enumerate(grid):
+    for x, cell in enumerate(row):
+        if (y, x) in seen:
+            continue
+        seen.add((y, x))
+        region = []
+        queue = [(y, x)]
+        while queue:
+            cury, curx = queue.pop(0)
+            region.append((cury, curx))
+            for dy, dx in nbrs:
+                nbry, nbrx = cury+dy, curx+dx
+                if 0 <= nbry < len(grid) and 0 <= nbrx < len(grid[0]) and \
+                    grid[nbry][nbrx] == cell and \
+                        (nbry, nbrx) not in seen:
+                    queue.append((nbry, nbrx))
+                    seen.add((nbry, nbrx))
+        regions.append(region)
+
+
+def calc_area_perim(region):
+    area = len(region)
+    miny, maxy = 10**10, 0
+    minx, maxx = 10**10, 0
+    for y, x in region:
+        miny = min(miny, y)
+        maxy = max(maxy, y)
+        minx = min(minx, x)
+        maxx = max(maxx, x)
+    region_id = grid[region[0][0]][region[0][1]]
+    perim = 0
+    for y in range(miny, maxy+1):
+        have_seen_cell = False
+        for x in range(minx, maxx+1):
+            if grid[y][x] == region_id and (y, x) in region:
+                if not have_seen_cell:
+                    perim += 2
+                have_seen_cell = True
+            else:
+                have_seen_cell = False
+    for x in range(minx, maxx+1):
+        have_seen_cell = False
+        for y in range(miny, maxy+1):
+            if grid[y][x] == region_id and (y, x) in region:
+                if not have_seen_cell:
+                    perim += 2
+                have_seen_cell = True
+            else:
+                have_seen_cell = False
+    return area, perim
+
+
+ans = 0
+for region in regions:
+    area, perim = calc_area_perim(region)
+    ans += (area * perim)
+
+print(ans)
+
+
+def calc_area_sides(region):
+    region_id = grid[region[0][0]][region[0][1]]
+    region = sorted(region)
+    print(region_id, region)
+    return 0, 0
+
+
+ans2 = 0
+for region in regions:
+    area, sides = calc_area_sides(region)
+    ans += (area * sides)
+
+print(ans2)

2024/13/main.py

@@ -0,0 +1,36 @@
+import sys
+from math import lcm
+
+data = open(sys.argv[1]).read().strip()
+groups = data.split('\n\n')
+
+ans, ans2 = 0, 0
+for group in groups:
+    lines = group.split('\n')
+    ax = int(lines[0].split()[2][2:][:-1])
+    ay = int(lines[0].split()[3][2:])
+    bx = int(lines[1].split()[2][2:][:-1])
+    by = int(lines[1].split()[3][2:])
+    px = int(lines[2].split()[1][2:][:-1])
+    py = int(lines[2].split()[2][2:])
+    px2 = px + 10000000000000
+    py2 = py + 10000000000000
+
+    a_lcm = lcm(ax, ay)
+    x_mult, y_mult = a_lcm//ax, a_lcm//ay
+
+    if (x_mult*px - y_mult*py) % (bx*x_mult - by*y_mult) == 0:
+        b = (x_mult*px - y_mult*py)//(bx*x_mult - by*y_mult)
+        if (px-bx*b) % ax == 0:
+            a = (px-bx*b)//ax
+            if a <= 100 and b <= 100:
+                ans += 3*a+b
+
+    if (x_mult*px2 - y_mult*py2) % (bx*x_mult - by*y_mult) == 0:
+        b = (x_mult*px2 - y_mult*py2)//(bx*x_mult - by*y_mult)
+        if (px2-bx*b) % ax == 0:
+            a = (px2-bx*b)//ax
+            ans2 += 3*a+b
+
+print(ans)
+print(ans2)