Advent of code

◂ 3 décembre 2025 ▸

  Lobby : Trouver le nombre à 12 chiffres le plus grand dans une séquence de chiffres.

2343453422 … 

285585556 … 

1. code.py

banks = []
with open('input.txt', 'r', encoding='utf-8') as f:
    for line in f:
        banks.append([(int)(c) for c in line.strip()])

def jolts(bank, nb_digits):
    number = 0
    i = -1
    for k in range(nb_digits,0,-1):
        if k == 1:
            mx = max(bank[i+1:])
        else:
            mx = max(bank[i+1:1-k])
        number = number*10 + mx
        i = bank.index(mx, i+1)
    return number


rep1 = sum(jolts(bank,  2) for bank in banks)
rep2 = sum(jolts(bank, 12) for bank in banks)
        
print("Réponse partie 1:", rep1)
print("Réponse partie 2:", rep2)