70 lines
2.1 KiB
Python
70 lines
2.1 KiB
Python
from utils.load import get_input
|
|
import unittest
|
|
from unittest import TestCase
|
|
import logging
|
|
|
|
logging.basicConfig(level=logging.DEBUG)
|
|
|
|
|
|
def solve_part1(pairs: list[list[str]]) -> int:
|
|
sum = 0
|
|
for lower, upper in pairs:
|
|
for n in range(int(lower), int(upper) + 1):
|
|
n_str = str(n)
|
|
n_len = len(n_str)
|
|
if n_len % 2 != 0:
|
|
continue
|
|
|
|
n_half = n_len // 2
|
|
|
|
if n_str[:n_half] == n_str[n_half:]:
|
|
logging.info("Found %s", n)
|
|
sum += n
|
|
|
|
return sum
|
|
|
|
|
|
def solve_part2(pairs: list[list[str]]) -> int:
|
|
sum = 0
|
|
for lower, upper in pairs:
|
|
for n in range(int(lower), int(upper) + 1):
|
|
n_str = str(n)
|
|
n_len = len(n_str)
|
|
n_half = n_len // 2
|
|
|
|
found = False
|
|
for offset in range(n_half):
|
|
if found:
|
|
break
|
|
for pattern_length in range(1, n_half + 1):
|
|
if n_len % pattern_length != 0:
|
|
continue
|
|
pattern = n_str[offset : offset + pattern_length]
|
|
if f"{pattern}" * (n_len // pattern_length) == n_str:
|
|
logging.info("Found %s", n_str)
|
|
sum += n
|
|
found = True
|
|
break
|
|
|
|
return sum
|
|
|
|
|
|
class TestDay01(TestCase):
|
|
def setUp(self):
|
|
input = "11-22,95-115,998-1012,1188511880-1188511890,222220-222224,1698522-1698528,446443-446449,38593856-38593862,565653-565659,824824821-824824827,2121212118-2121212124"
|
|
pairs = input.split(",")
|
|
self.data = [pair.split("-", 2) for pair in pairs]
|
|
|
|
def __test_part_1(self):
|
|
self.assertEqual(solve_part1(self.data), 1227775554)
|
|
|
|
def test_part_2(self):
|
|
self.assertEqual(solve_part2(self.data), 4174379265)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
data = [pair.split("-", 2) for pair in get_input(2).splitlines()[0].split(",")]
|
|
#logging.info("Part1 %s", solve_part1(data))
|
|
#logging.info("Part2 %s", solve_part2(data))
|
|
unittest.main()
|