andreas/aoc24
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Added solution for day11

Browse source
This commit is contained in:
Andreas 2024-12-11 07:22:39 +01:00 • committed by Andreas
parent 91338c6114
commit ecfff8354f
4 changed files with 52 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
day11/example.txt Normal file
View file

@ -0,0 +1 @@
125 17

1
day11/input.txt Normal file
View file

@ -0,0 +1 @@
3279 998884 1832781 517 8 18864 28 0

25
day11/solution.py Normal file
View file

@ -0,0 +1,25 @@
import sys
from tqdm import tqdm
def main(input):
input_list: list = input.split(" ")
for i in tqdm(range(25)):
new_stones = []
for num in input_list:
if num == '0':
new_stones.extend(["1"])
elif len(num) % 2 == 0:
half = len(num) // 2
left_half = str(int(num[:half]))
right_half = str(int(num[half:]))
new_stones.extend([left_half, right_half])
else:
new_stones.extend([str(int(num)*2024)])
input_list = new_stones
print(len(input_list))
if __name__ == "__main__":
input_text = sys.stdin.read().strip()
main(input_text)

25
day11/solution2.py Normal file
View file

@ -0,0 +1,25 @@
import sys
from tqdm import tqdm
def main(input):
input_list: list = input.split(" ")
for i in tqdm(range(75)):
new_stones = []
for num in input_list:
if num == '0':
new_stones.extend(["1"])
elif len(num) % 2 == 0:
half = len(num) // 2
left_half = str(int(num[:half]))
right_half = str(int(num[half:]))
new_stones.extend([left_half, right_half])
else:
new_stones.extend([str(int(num)*2024)])
input_list = new_stones
print(len(input_list))
if __name__ == "__main__":
input_text = sys.stdin.read().strip()
main(input_text)