Solved 2025 Day 3 Parts 1 & 2
This commit is contained in:
1 parent
14a422d4e2
commit
4fe4802afc
6 files changed
+468
No files matched your search
@@ -0,0 +1,21 @@
|
||||
|
||||
input_file = "input.txt"
|
||||
|
||||
banks: list[list[int]] = []
|
||||
|
||||
with open(input_file, 'r') as file:
|
||||
banks = [ [ int(n) for n in line.strip() ] for line in file.readlines() ]
|
||||
|
||||
total_joltage = 0
|
||||
|
||||
for i, bank in enumerate(banks):
|
||||
n1 = max(bank[:-1])
|
||||
|
||||
n2 = max(bank[bank.index(n1) + 1:])
|
||||
|
||||
print(f'Largest Joltage for Bank {i + 1}: {n1}{n2}')
|
||||
|
||||
total_joltage += 10 * n1 + n2
|
||||
|
||||
print(f'Total Joltage: {total_joltage}')
|
||||
|
||||
Reference in new issue
Block a user