AdventOfCode/2024/01/solution.py

37 lines
694 B
Python
Raw Normal View History

from aocd import get_data
data = get_data(day=1, year=2024)
2024-12-03 15:33:24 -04:00
# Condition data
2024-12-02 18:34:33 -04:00
list1 = []
list2 = []
lines = data.split("\n")
2024-12-02 18:34:33 -04:00
for line in lines:
2024-12-03 15:33:24 -04:00
nums = line.split(" ")
num1 = int(nums[0])
num2 = int(nums[1])
list1.append(num1)
list2.append(num2)
2024-12-02 18:34:33 -04:00
list1.sort()
list2.sort()
2024-12-03 15:33:24 -04:00
# Part 1
2024-12-02 18:34:33 -04:00
total_dist = 0
for i in range(len(list1)):
dist = list2[i] - list1[i]
dist = abs(dist)
total_dist += dist
print("Total distance: ", total_dist)
2024-12-03 15:33:24 -04:00
# Part 2
2024-12-02 18:34:33 -04:00
total_similarity = 0
for i in range(len(list1)):
num = list1[i]
occurs = 0
for j in range(len(list2)):
if num == list2[j]:
occurs += 1
similarity = num * occurs
total_similarity += similarity
print("Total similarity: ", total_similarity)