Advent of Code 2024, day 11

AdventOfCode2024.Day11.py

import sys
from itertools import combinations

sys.setrecursionlimit(10**6)

with open("./data/input11.txt") as inputFile:
    input = inputFile.read()

stones = []
for num in input.split(' '):
    stones.append(int(num))

def replace_stone(stone):
    replacement = []
    stonestr = str(stone)
    if stone == 0:
        replacement.append(1)
    elif len(stonestr) % 2 == 0:
        halflen = len(stonestr) // 2
        replacement.append(int(stonestr[0:halflen:]))
        replacement.append(int(stonestr[halflen::]))
    else:
        replacement.append(stone * 2024)
    return replacement

acc = dict()

def expand_stone(stone, times):
    if times == 0: return 1
    elif (stone, times) in acc.keys(): return acc[(stone, times)]
    else:
        stones = replace_stone(stone)
        if stone < 100:
            acc[(stone, 1)] = len(stones)
        total = 0
        for s in stones:
            total += expand_stone(s, times-1)
        acc[(stone, times)] = total
        return total

def get_length(stones, times):
    total = 0
    for stone in stones: 
        total += expand_stone(stone, times)
    return total

# Part 1
print(get_length(stones, 25))

# Part 2
print(get_length(stones, 75))