Ovre på https://adventofcode.com/ kan man hver dag finde to kodeopgaver og prøve at løse dem. Det er nærmest som kryds-og-tværs eller sudoko, bare med kode i stedet. Her er mine løsninger.
Dag 11, del 2:
octopi = '''6744638455
3135745418
4754123271
4224257161
8167186546
2268577674
7177768175
2662255275
4655343376
7852526168'''
octopusses =[]
index = 0
line_counter = 0
for oct in octopi:
if oct == "\n":
line = octopusses.append([])
line_counter += 1
elif index == 0:
line = octopusses.append([])
octopusses[line_counter].append(int(oct))
index += 1
else:
octopusses[line_counter].append(int(oct))
number_of_rows = len(octopusses)
numbers_per_row = len(octopusses[0])
def get_valid_neighbours(point):
neighbours = [
[point[0]-1, point[1]],
[point[0]-1, point[1]+1],
[point[0], point[1]+1],
[point[0]+1, point[1]+1],
[point[0]+1, point[1]],
[point[0]+1, point[1]-1],
[point[0], point[1]-1],
[point[0]-1, point[1]-1],
]
valid_neighbours = []
for neighbour in neighbours:
if not neighbour[0] < 0 and not neighbour[0] > number_of_rows - 1 and not neighbour[1] < 0 and not neighbour[1] > numbers_per_row - 1:
valid_neighbours.append(neighbour)
return valid_neighbours
def get_neighbours_with_energy_level_10(neighbours, energy_levels):
ten_count = 0
for neighbour in neighbours:
try:
if energy_levels[neighbour[0]][neighbour[1]] == "flash":
ten_count += 1
except:
print(neighbours)
breakpoint()
return ten_count
def flash_octopusses(energy_levels):
updated_energy_levels = []
row_number = 0
for row in energy_levels:
updated_energy_levels.append([])
column = 0
for octopus in row:
if not octopus == "flash":
if octopus < 10 and not octopus == 0:
neighbours = get_valid_neighbours([row_number, column])
energy_level_rise = get_neighbours_with_energy_level_10(neighbours, energy_levels)
octopus += energy_level_rise
if octopus > 10:
octopus = 10
updated_energy_levels[row_number].append(octopus)
else:
updated_energy_levels[row_number].append(octopus)
else:
updated_energy_levels[row_number].append(octopus)
column += 1
row_number += 1
ten_in_levels = ten_in_energy_levels(updated_energy_levels)
if ten_in_levels:
replace = replace_ten_with_flash_and_flash_with_zero(updated_energy_levels)
else:
return step_octopusses.append(updated_energy_levels)
def replace_ten_with_flash_and_flash_with_zero(energy_levels):
updated_energy_levels = []
row_number = 0
for row in energy_levels:
updated_energy_levels.append([])
column = 0
for octopus in row:
if octopus == 10:
octopus = "flash"
elif octopus == "flash":
octopus = 0
updated_energy_levels[row_number].append(octopus)
column += 1
row_number += 1
return flash_octopusses(updated_energy_levels)
# Determine whether at least one octopus has 10 in energy levels
def ten_in_energy_levels(energy_levels):
for row in energy_levels:
for octopus in row:
if octopus == "flash":
return True
return False
def add_one_to_levels(octopusses):
energy_levels = []
for line in octopusses:
octopi_in_line = []
for octopus in line:
octopus += 1
if octopus == 10:
octopus = "flash"
octopi_in_line.append(octopus)
energy_levels.append(octopi_in_line)
octopusses = energy_levels
return octopusses
# First part of step
step_octopusses = []
number_of_steps = 1000
for i in range(number_of_steps):
octopusses = add_one_to_levels(octopusses)
ten_in_levels = ten_in_energy_levels(octopusses)
if ten_in_levels:
flash_octopusses(octopusses)
octopusses = step_octopusses[-1]
else:
step_octopusses.append(octopusses)
flashes = 0
step_counter = 0
for step in step_octopusses:
flashes_per_step = 0
for row in step:
for number in row:
if number == 0:
flashes += 1
flashes_per_step += 1
step_counter += 1
if flashes_per_step == 100:
print(step_counter)
break
Dag 11, del 1:
Arrghhh.
octopi = '''6744638455
3135745418
4754123271
4224257161
8167186546
2268577674
7177768175
2662255275
4655343376
7852526168'''
octopusses =[]
index = 0
line_counter = 0
for oct in octopi:
if oct == "\n":
line = octopusses.append([])
line_counter += 1
elif index == 0:
line = octopusses.append([])
octopusses[line_counter].append(int(oct))
index += 1
else:
octopusses[line_counter].append(int(oct))
number_of_rows = len(octopusses)
numbers_per_row = len(octopusses[0])
def get_valid_neighbours(point):
neighbours = [
[point[0]-1, point[1]],
[point[0]-1, point[1]+1],
[point[0], point[1]+1],
[point[0]+1, point[1]+1],
[point[0]+1, point[1]],
[point[0]+1, point[1]-1],
[point[0], point[1]-1],
[point[0]-1, point[1]-1],
]
valid_neighbours = []
for neighbour in neighbours:
if not neighbour[0] < 0 and not neighbour[0] > number_of_rows - 1 and not neighbour[1] < 0 and not neighbour[1] > numbers_per_row - 1:
valid_neighbours.append(neighbour)
return valid_neighbours
def get_neighbours_with_energy_level_10(neighbours, energy_levels):
ten_count = 0
for neighbour in neighbours:
try:
if energy_levels[neighbour[0]][neighbour[1]] == "flash":
ten_count += 1
except:
print(neighbours)
breakpoint()
return ten_count
def flash_octopusses(energy_levels):
updated_energy_levels = []
row_number = 0
for row in energy_levels:
updated_energy_levels.append([])
column = 0
for octopus in row:
if not octopus == "flash":
if octopus < 10 and not octopus == 0:
neighbours = get_valid_neighbours([row_number, column])
energy_level_rise = get_neighbours_with_energy_level_10(neighbours, energy_levels)
octopus += energy_level_rise
if octopus > 10:
octopus = 10
updated_energy_levels[row_number].append(octopus)
else:
updated_energy_levels[row_number].append(octopus)
else:
updated_energy_levels[row_number].append(octopus)
column += 1
row_number += 1
ten_in_levels = ten_in_energy_levels(updated_energy_levels)
if ten_in_levels:
replace = replace_ten_with_flash_and_flash_with_zero(updated_energy_levels)
else:
return step_octopusses.append(updated_energy_levels)
def replace_ten_with_flash_and_flash_with_zero(energy_levels):
updated_energy_levels = []
row_number = 0
for row in energy_levels:
updated_energy_levels.append([])
column = 0
for octopus in row:
if octopus == 10:
octopus = "flash"
elif octopus == "flash":
octopus = 0
updated_energy_levels[row_number].append(octopus)
column += 1
row_number += 1
return flash_octopusses(updated_energy_levels)
# Determine whether at least one octopus has 10 in energy levels
def ten_in_energy_levels(energy_levels):
for row in energy_levels:
for octopus in row:
if octopus == "flash":
return True
return False
def add_one_to_levels(octopusses):
energy_levels = []
for line in octopusses:
octopi_in_line = []
for octopus in line:
octopus += 1
if octopus == 10:
octopus = "flash"
octopi_in_line.append(octopus)
energy_levels.append(octopi_in_line)
octopusses = energy_levels
return octopusses
# First part of step
step_octopusses = []
number_of_steps = 100
for i in range(number_of_steps):
octopusses = add_one_to_levels(octopusses)
ten_in_levels = ten_in_energy_levels(octopusses)
if ten_in_levels:
flash_octopusses(octopusses)
octopusses = step_octopusses[-1]
else:
step_octopusses.append(octopusses)
flashes = 0
for step in step_octopusses:
for row in step:
for number in row:
if number == 0:
flashes += 1
print(flashes)
Dag 10, del 2:
lines = []
with open("input_day10.txt", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
lines.append(f)
opening_characters = ["(", "<", "{", "["]
closing_characters = [")", ">", "}", "]"]
def check_numbers_between(match_indexes, character_index, i):
for number_between in range(character_index - i + 1, character_index):
if number_between not in match_indexes:
return False
return True
corrupted_lines = []
illegal_characters = []
for line in lines:
closing_characters_list = sorted([index for index, character in enumerate(line) for closing_character in closing_characters if character == closing_character])
used_character_indexes = []
match_indexes = []
for character_index in closing_characters_list:
closing_character = line[character_index]
correct_opening_character = opening_characters[closing_characters.index(closing_character)]
found_a_match = False
for i in range(1, character_index + 1, 2):
if line[character_index - i] == correct_opening_character and character_index - i not in used_character_indexes:
used_character_indexes.append(character_index - i)
# Check in match_indexes whether everything within a match range is covered by already detected matches
if i > 1:
found_a_match = check_numbers_between(match_indexes, character_index, i)
if found_a_match == False:
break
match_indexes.append(character_index - i)
match_indexes.append(character_index)
found_a_match = True
break
if found_a_match == False:
illegal_characters.append(closing_character)
corrupted_lines.append(line)
break
incomplete_lines = [line for line in lines if line not in corrupted_lines]
scores = []
for line in incomplete_lines:
closing_characters_list = sorted([index for index, character in enumerate(line) for closing_character in closing_characters if character == closing_character])
used_character_indexes = []
match_indexes = []
for character_index in closing_characters_list:
closing_character = line[character_index]
correct_opening_character = opening_characters[closing_characters.index(closing_character)]
found_a_match = False
for i in range(1, character_index + 1, 2):
if line[character_index - i] == correct_opening_character and character_index - i not in used_character_indexes:
used_character_indexes.append(character_index - i)
match_indexes.append(character_index - i)
match_indexes.append(character_index)
break
indexes_of_tags_to_close = []
for i in range(len(line)):
if i not in match_indexes:
indexes_of_tags_to_close.append(i)
end_string = ""
for index in reversed(indexes_of_tags_to_close):
character = line[index]
open_character_position = opening_characters.index(character)
closing_character = closing_characters[open_character_position]
end_string += closing_character
score = 0
for character in end_string:
score = 5 * score
if character == ")":
score += 1
elif character == "]":
score += 2
elif character == "}":
score += 3
elif character == ">":
score += 4
scores.append(score)
sorted_scores = sorted(scores)
scores_length = len(sorted_scores)
middle_score = sorted_scores[int((scores_length-1)/2)]
print(middle_score)
Dag 10, del 1:
Nu er jeg ved at nå grænsen for, hvad jeg kan finde ud af inden for rimelig tid.
lines = []
with open("input_day10.txt", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
lines.append(f)
opening_characters = ["(", "<", "{", "["]
closing_characters = [")", ">", "}", "]"]
def check_numbers_between(match_indexes, character_index, i):
for number_between in range(character_index - i + 1, character_index):
if number_between not in match_indexes:
return False
return True
illegal_characters = []
for line in lines:
closing_characters_list = sorted([index for index, character in enumerate(line) for closing_character in closing_characters if character == closing_character])
used_character_indexes = []
match_indexes = []
for character_index in closing_characters_list:
closing_character = line[character_index]
correct_opening_character = opening_characters[closing_characters.index(closing_character)]
found_a_match = False
for i in range(1, character_index + 1, 2):
if line[character_index - i] == correct_opening_character and character_index - i not in used_character_indexes:
used_character_indexes.append(character_index - i)
# Check in match_indexes whether everything within a match range is covered by already detected matches
if i > 1:
found_a_match = check_numbers_between(match_indexes, character_index, i)
if found_a_match == False:
break
match_indexes.append(character_index - i)
match_indexes.append(character_index)
found_a_match = True
break
if found_a_match == False:
illegal_characters.append(closing_character)
break
points = 0
for character in illegal_characters:
if character == closing_characters[0]:
points += 3
elif character == closing_characters[1]:
points += 25137
elif character == closing_characters[2]:
points += 1197
elif character == closing_characters[3]:
points += 57
print(points)
Dag 9, del 2:
points = []
with open("input_day9", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
points.append([int(value) for value in f])
number_of_rows = len(points)
numbers_per_row = len(points[0])
low_point_coordinates = []
low_points = []
row_index = 0
for row in points:
point_index = 0
for point in row:
# First row
if row_index == 0 and point_index == 0:
if row[point_index + 1] > point and points[row_index + 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif row_index == 0 and point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index + 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif row_index == 0:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index + 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif row_index == number_of_rows - 1 and point_index == 0:
if row[point_index + 1] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif row_index == number_of_rows - 1 and point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif row_index == number_of_rows - 1:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif point_index == 0:
if row[point_index + 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
elif point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
else:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_point_coordinates.append([row_index, point_index])
low_points.append(point + 1)
point_index += 1
row_index += 1
def get_neighbours(point):
neighbours = [
[point[0], point[1]+1],
[point[0], point[1]-1],
[point[0]+1, point[1]],
[point[0]-1, point[1]],
]
for neighbour in neighbours:
if not neighbour[0] < 0 and not neighbour[0] > number_of_rows - 1 and not neighbour[1] < 0 and not neighbour[1] > numbers_per_row - 1:
if points[neighbour[0]][neighbour[1]] != 9 and neighbour not in valid_neighbours:
valid_neighbours.append(neighbour)
get_neighbours(neighbour)
return valid_neighbours
basins = []
for low_point in low_point_coordinates:
valid_neighbours = []
valid_neighbours.append(low_point)
neighbours = get_neighbours(low_point)
basins.append(neighbours)
basins.sort(key=len, reverse=True)
product_of_large_basins = len(basins[0]) * len(basins[1]) * len(basins[2])
print(product_of_large_basins)
Dag 9, del 1:
points = []
with open("input_day9", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
points.append([int(value) for value in f])
number_of_rows = len(points)
numbers_per_row = len(points[0])
low_points = []
row_index = 0
for row in points:
point_index = 0
for point in row:
# First row
if row_index == 0 and point_index == 0:
if row[point_index + 1] > point and points[row_index + 1][point_index] > point:
low_points.append(point + 1)
elif row_index == 0 and point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index + 1][point_index] > point:
low_points.append(point + 1)
elif row_index == 0:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index + 1][point_index] > point:
low_points.append(point + 1)
elif row_index == number_of_rows - 1 and point_index == 0:
if row[point_index + 1] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
elif row_index == number_of_rows - 1 and point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
elif row_index == number_of_rows - 1:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
elif point_index == 0:
if row[point_index + 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
elif point_index == numbers_per_row - 1:
if row[point_index - 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
else:
if row[point_index + 1] > point and row[point_index - 1] > point and points[row_index + 1][point_index] > point and points[row_index - 1][point_index] > point:
low_points.append(point + 1)
point_index += 1
row_index += 1
print(sum(low_points))
Dag 8, del 2:
def get_mapping(signals):
zero = ""
one = ""
two = ""
three = ""
four = ""
five = ""
six = ""
seven = ""
eight = ""
nine = ""
digits = {
5: [],
6: []
}
for signal in signals:
if len(signal) == 2:
one = signal
elif len(signal) == 3:
seven = signal
elif len(signal) == 4:
four = signal
elif len(signal) == 7:
eight = signal
elif len(signal) == 5:
digits[5].append(signal)
elif len(signal) == 6:
digits[6].append(signal)
# Only one of 2, 3 and 5 (five segments) has both segments of 1: 3
for signal in digits[5]:
count = 0
for letter in one:
if letter in signal:
count += 1
if count == 2:
three = signal
digits[5].remove(signal)
# Of 2 and 5, only 5 has both b and d from 4, which can be determined by getting the difference between 4 and 1:
four_one_difference = ""
for character in four:
if character not in one:
four_one_difference += character
for signal in digits[5]:
for character in four_one_difference:
if character not in signal:
two = signal
digits[5].remove(signal)
five = digits[5][0]
# Zero is the only 6-segment number that doesn't have d
for signal in digits[6]:
for character in four_one_difference:
if character not in signal:
zero = signal
digits[6].remove(signal)
# Six does not have both c and f from one
for signal in digits[6]:
for character in one:
if character not in signal:
six = signal
digits[6].remove(signal)
nine = digits[6][0]
return [zero,one,two,three,four,five,six,seven,eight,nine]
sum_of_output_values = 0
with open("input_day8", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
signals = f[:f.index(" | ")].split(" ")
mappings = get_mapping(signals)
mappings_alphabetical = [sorted(list(digit)) for digit in mappings]
output = f[f.index(" | ")+3:].split(" ")
output_alphabetical = [sorted(list(digit)) for digit in output]
output_value = ""
for value in output_alphabetical:
number = mappings_alphabetical.index(value)
output_value += str(number)
output_value = int(output_value)
sum_of_output_values += output_value
print(sum_of_output_values)
Dag 8, del 1:
segment_lengths = [2,3,4,7]
count_of_unique_digits = 0
with open("input_day8", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
output = f[f.index(" | ")+3:].split(" ")
for value in output:
if len(value) in segment_lengths:
count_of_unique_digits += 1
print(count_of_unique_digits)
Dag 7, del 2:
initial = [1101,1,29,67,1102,0,1,65,1008,65,35,66,1005,66,28,1,67,65,20,4,0,1001,65,1,65,1106,0,8,99,35,67,101,99,105,32,110,39,101,115,116,32,112,97,115,32,117,110,101,32,105,110,116,99,111,100,101,32,112,114,111,103,114,97,109,10,478,1187,253,1892,900,155,20,787,17,248,1397,407,167,686,638,1020,960,124,840,220,1824,700,373,4,551,229,294,567,254,350,1144,679,124,361,145,483,335,202,1334,367,60,870,11,557,482,645,672,1296,1538,427,78,542,1135,13,65,0,140,705,13,642,187,1085,36,1118,349,601,382,584,941,26,949,200,763,198,430,204,1352,1135,210,342,11,1089,830,1523,9,523,167,762,254,805,8,132,29,102,1299,936,756,59,134,183,235,316,139,48,182,44,88,213,113,93,169,565,601,1899,1191,189,796,770,32,1183,365,374,867,918,1084,86,75,20,47,99,1140,2,99,1024,366,455,752,556,1220,66,326,450,213,1,342,756,49,675,160,280,68,221,193,379,88,179,94,16,109,570,1145,1207,824,355,1389,1601,168,86,236,923,120,759,14,478,460,84,167,1723,1005,269,6,171,861,311,832,952,701,3,1598,1466,96,780,57,161,631,572,276,105,594,276,17,405,688,1444,173,23,199,177,689,19,565,472,151,986,76,379,1430,212,928,106,25,143,84,833,942,860,1555,271,239,720,596,1209,235,535,361,1794,79,283,275,17,342,1687,1434,173,967,740,217,1370,18,1579,1259,546,94,623,475,834,1000,456,101,520,120,1023,360,167,213,617,42,1149,629,760,17,33,27,1347,414,646,1116,1340,134,259,143,407,249,328,968,677,241,438,98,313,27,791,1,634,3,918,1482,213,123,444,45,24,26,26,1203,64,67,1562,1,4,298,12,384,32,443,37,268,674,356,202,286,694,272,163,950,1022,54,59,21,73,519,462,106,76,1112,10,72,388,194,6,120,9,645,209,1121,75,599,362,661,439,69,62,339,390,23,1247,365,1266,4,246,511,47,467,134,276,497,130,458,427,669,1191,701,917,168,1191,294,641,236,801,375,106,872,800,87,356,583,1096,253,459,951,1331,719,66,1091,525,15,370,290,141,1201,30,43,37,76,1131,616,297,172,402,1016,654,301,63,872,303,69,1195,502,351,52,1659,86,104,294,807,166,120,190,333,60,283,819,198,184,144,278,343,1395,496,103,705,485,172,642,225,181,583,188,38,436,801,91,5,634,180,28,20,146,488,676,121,420,965,220,1564,1011,241,423,3,1631,709,106,725,164,1032,65,205,503,188,397,1072,49,121,761,721,249,418,87,126,258,712,500,435,157,127,681,108,270,647,504,505,83,407,212,165,1177,160,715,1292,491,195,141,25,829,1316,242,754,364,1707,33,594,434,488,368,298,183,1156,29,1674,537,378,8,9,860,240,571,749,471,331,501,156,62,427,1103,52,12,832,1198,284,388,827,556,194,288,218,397,84,1485,95,401,739,986,994,305,668,1324,1437,312,993,15,822,923,707,135,42,423,37,1183,1344,997,19,699,395,119,7,168,1711,50,151,38,20,163,686,1364,21,24,411,32,335,188,55,628,274,1766,439,180,286,1024,87,15,1498,290,561,971,32,294,67,113,219,42,18,715,3,664,242,583,221,1045,236,74,46,1612,639,325,164,100,69,518,38,502,26,329,112,1174,127,124,90,144,527,468,152,1098,800,125,349,191,290,191,27,651,446,267,9,1304,269,586,64,983,152,236,512,8,248,177,109,311,957,47,126,69,13,709,204,381,1151,580,340,994,865,258,190,9,1149,930,1128,321,100,471,0,507,1308,326,585,813,1088,76,174,333,387,631,186,430,988,24,820,11,45,173,167,1494,98,1467,456,167,21,1363,1173,394,318,1601,1111,1249,757,282,672,1227,1214,277,336,815,136,1192,681,689,431,130,1488,154,465,14,709,339,1123,68,151,1280,143,1797,23,250,1231,1007,302,1103,2,585,552,1732,994,225,771,1495,82,229,700,910,15,38,159,1122,316,1044,711,1436,920,1722,523,1398,188,443,1032,93,33,397,272,187,24,489,53,79,1277,671,1094,68,1705,984,1096,512,145,389,167,161,1174,94,4,534,1295,648,75,24,366,995,175,220,714,843,412,267,634,1209,66,1094,125,822,1114,1513,694,1520,30,676,817,245,26,77,1146,552,143,165,39,343,971,87,0,90,1434,588,616,99,297,1034,114,5,702,917,582,733,31,54,820,0,212,192,282,33,639,1661,460,75,680,115,178,194,271,274,582,1008,89,139,611,707,0,376,65,9,161,135,40,134,566,66,601,95,817,745,202,352,447,322,842,6,1247,175,468,330,608,368,139,21,29,486,121,9,1293,298,73,328,302,145,889,1794,677,56,952,520,80]
minimum_value = min(initial)
maximum_value = max(initial)
def get_fuel_use(distance):
fuel_use = 0
if distance == 0:
return fuel_use
for i in range(distance+1):
fuel_use += i
return fuel_use
distances = {}
for i in range(minimum_value, maximum_value+1):
distances[i] = 0
for crab in initial:
if i > crab:
distance = i - crab
elif i < crab:
distance = crab - i
else:
distance = 0
fuel_use = get_fuel_use(distance)
distances[i] += fuel_use
minimum_fuel_consumption = 0
first_run = True
for position, fuel_consumption in distances.items():
if first_run == True:
minimum_fuel_consumption = fuel_consumption
first_run = False
elif fuel_consumption < minimum_fuel_consumption:
minimum_fuel_consumption = fuel_consumption
print(minimum_fuel_consumption)
Dag 7, del 1:
initial = [1101,1,29,67,1102,0,1,65,1008,65,35,66,1005,66,28,1,67,65,20,4,0,1001,65,1,65,1106,0,8,99,35,67,101,99,105,32,110,39,101,115,116,32,112,97,115,32,117,110,101,32,105,110,116,99,111,100,101,32,112,114,111,103,114,97,109,10,478,1187,253,1892,900,155,20,787,17,248,1397,407,167,686,638,1020,960,124,840,220,1824,700,373,4,551,229,294,567,254,350,1144,679,124,361,145,483,335,202,1334,367,60,870,11,557,482,645,672,1296,1538,427,78,542,1135,13,65,0,140,705,13,642,187,1085,36,1118,349,601,382,584,941,26,949,200,763,198,430,204,1352,1135,210,342,11,1089,830,1523,9,523,167,762,254,805,8,132,29,102,1299,936,756,59,134,183,235,316,139,48,182,44,88,213,113,93,169,565,601,1899,1191,189,796,770,32,1183,365,374,867,918,1084,86,75,20,47,99,1140,2,99,1024,366,455,752,556,1220,66,326,450,213,1,342,756,49,675,160,280,68,221,193,379,88,179,94,16,109,570,1145,1207,824,355,1389,1601,168,86,236,923,120,759,14,478,460,84,167,1723,1005,269,6,171,861,311,832,952,701,3,1598,1466,96,780,57,161,631,572,276,105,594,276,17,405,688,1444,173,23,199,177,689,19,565,472,151,986,76,379,1430,212,928,106,25,143,84,833,942,860,1555,271,239,720,596,1209,235,535,361,1794,79,283,275,17,342,1687,1434,173,967,740,217,1370,18,1579,1259,546,94,623,475,834,1000,456,101,520,120,1023,360,167,213,617,42,1149,629,760,17,33,27,1347,414,646,1116,1340,134,259,143,407,249,328,968,677,241,438,98,313,27,791,1,634,3,918,1482,213,123,444,45,24,26,26,1203,64,67,1562,1,4,298,12,384,32,443,37,268,674,356,202,286,694,272,163,950,1022,54,59,21,73,519,462,106,76,1112,10,72,388,194,6,120,9,645,209,1121,75,599,362,661,439,69,62,339,390,23,1247,365,1266,4,246,511,47,467,134,276,497,130,458,427,669,1191,701,917,168,1191,294,641,236,801,375,106,872,800,87,356,583,1096,253,459,951,1331,719,66,1091,525,15,370,290,141,1201,30,43,37,76,1131,616,297,172,402,1016,654,301,63,872,303,69,1195,502,351,52,1659,86,104,294,807,166,120,190,333,60,283,819,198,184,144,278,343,1395,496,103,705,485,172,642,225,181,583,188,38,436,801,91,5,634,180,28,20,146,488,676,121,420,965,220,1564,1011,241,423,3,1631,709,106,725,164,1032,65,205,503,188,397,1072,49,121,761,721,249,418,87,126,258,712,500,435,157,127,681,108,270,647,504,505,83,407,212,165,1177,160,715,1292,491,195,141,25,829,1316,242,754,364,1707,33,594,434,488,368,298,183,1156,29,1674,537,378,8,9,860,240,571,749,471,331,501,156,62,427,1103,52,12,832,1198,284,388,827,556,194,288,218,397,84,1485,95,401,739,986,994,305,668,1324,1437,312,993,15,822,923,707,135,42,423,37,1183,1344,997,19,699,395,119,7,168,1711,50,151,38,20,163,686,1364,21,24,411,32,335,188,55,628,274,1766,439,180,286,1024,87,15,1498,290,561,971,32,294,67,113,219,42,18,715,3,664,242,583,221,1045,236,74,46,1612,639,325,164,100,69,518,38,502,26,329,112,1174,127,124,90,144,527,468,152,1098,800,125,349,191,290,191,27,651,446,267,9,1304,269,586,64,983,152,236,512,8,248,177,109,311,957,47,126,69,13,709,204,381,1151,580,340,994,865,258,190,9,1149,930,1128,321,100,471,0,507,1308,326,585,813,1088,76,174,333,387,631,186,430,988,24,820,11,45,173,167,1494,98,1467,456,167,21,1363,1173,394,318,1601,1111,1249,757,282,672,1227,1214,277,336,815,136,1192,681,689,431,130,1488,154,465,14,709,339,1123,68,151,1280,143,1797,23,250,1231,1007,302,1103,2,585,552,1732,994,225,771,1495,82,229,700,910,15,38,159,1122,316,1044,711,1436,920,1722,523,1398,188,443,1032,93,33,397,272,187,24,489,53,79,1277,671,1094,68,1705,984,1096,512,145,389,167,161,1174,94,4,534,1295,648,75,24,366,995,175,220,714,843,412,267,634,1209,66,1094,125,822,1114,1513,694,1520,30,676,817,245,26,77,1146,552,143,165,39,343,971,87,0,90,1434,588,616,99,297,1034,114,5,702,917,582,733,31,54,820,0,212,192,282,33,639,1661,460,75,680,115,178,194,271,274,582,1008,89,139,611,707,0,376,65,9,161,135,40,134,566,66,601,95,817,745,202,352,447,322,842,6,1247,175,468,330,608,368,139,21,29,486,121,9,1293,298,73,328,302,145,889,1794,677,56,952,520,80]
minimum_value = min(initial)
maximum_value = max(initial)
distances = {}
for i in range(minimum_value, maximum_value+1):
distances[i] = 0
for crab in initial:
if i > crab:
distance = i - crab
elif i < crab:
distance = crab - i
else:
distance = 0
distances[i] += distance
minimum_fuel_consumption = 0
first_run = True
for position, fuel_consumption in distances.items():
if first_run == True:
minimum_fuel_consumption = fuel_consumption
first_run = False
elif fuel_consumption < minimum_fuel_consumption:
minimum_fuel_consumption = fuel_consumption
print(minimum_fuel_consumption)
Dag 6, del 2:
initial = [3,4,1,1,5,1,3,1,1,3,5,1,1,5,3,2,4,2,2,2,1,1,1,1,5,1,1,1,1,1,3,1,1,5,4,1,1,1,4,1,1,1,1,2,3,2,5,1,5,1,2,1,1,1,4,1,1,1,1,3,1,1,3,1,1,1,1,1,1,2,3,4,2,1,3,1,1,2,1,1,2,1,5,2,1,1,1,1,1,1,4,1,1,1,1,5,1,4,1,1,1,3,3,1,3,1,3,1,4,1,1,1,1,1,4,5,1,1,3,2,2,5,5,4,3,1,2,1,1,1,4,1,3,4,1,1,1,1,2,1,1,3,2,1,1,1,1,1,4,1,1,1,4,4,5,2,1,1,1,1,1,2,4,2,1,1,1,2,1,1,2,1,5,1,5,2,5,5,1,1,3,1,4,1,1,1,1,1,1,1,4,1,1,4,1,1,1,1,1,2,1,2,1,1,1,5,1,1,3,5,1,1,5,5,3,5,3,4,1,1,1,3,1,1,3,1,1,1,1,1,1,5,1,3,1,5,1,1,4,1,3,1,1,1,2,1,1,1,2,1,5,1,1,1,1,4,1,3,2,3,4,1,3,5,3,4,1,4,4,4,1,3,2,4,1,4,1,1,2,1,3,1,5,5,1,5,1,1,1,5,2,1,2,3,1,4,3,3,4,3]
counts = {
0: 0,
1: 0,
2: 0,
3: 0,
4: 0,
5: 0,
6: 0,
7: 0,
8: 0,
}
for i in initial:
counts[i] += 1
for day in range(1,257):
new_spawn_and_reset = counts[0]
for i in range(0,9):
if i < 8:
counts[i] = counts[i+1]
if i == 6:
counts[i] += new_spawn_and_reset
if i == 8:
counts[i] = new_spawn_and_reset
sum_of_counts = 0
for key, value in counts.items():
sum_of_counts += value
print("fish: ", sum_of_counts)
Dag 6, del 1:
initial = [3,4,1,1,5,1,3,1,1,3,5,1,1,5,3,2,4,2,2,2,1,1,1,1,5,1,1,1,1,1,3,1,1,5,4,1,1,1,4,1,1,1,1,2,3,2,5,1,5,1,2,1,1,1,4,1,1,1,1,3,1,1,3,1,1,1,1,1,1,2,3,4,2,1,3,1,1,2,1,1,2,1,5,2,1,1,1,1,1,1,4,1,1,1,1,5,1,4,1,1,1,3,3,1,3,1,3,1,4,1,1,1,1,1,4,5,1,1,3,2,2,5,5,4,3,1,2,1,1,1,4,1,3,4,1,1,1,1,2,1,1,3,2,1,1,1,1,1,4,1,1,1,4,4,5,2,1,1,1,1,1,2,4,2,1,1,1,2,1,1,2,1,5,1,5,2,5,5,1,1,3,1,4,1,1,1,1,1,1,1,4,1,1,4,1,1,1,1,1,2,1,2,1,1,1,5,1,1,3,5,1,1,5,5,3,5,3,4,1,1,1,3,1,1,3,1,1,1,1,1,1,5,1,3,1,5,1,1,4,1,3,1,1,1,2,1,1,1,2,1,5,1,1,1,1,4,1,3,2,3,4,1,3,5,3,4,1,4,4,4,1,3,2,4,1,4,1,1,2,1,3,1,5,5,1,5,1,1,1,5,2,1,2,3,1,4,3,3,4,3]
for day in range(1,81):
index = 0
for fish in initial:
fish -= 1
if fish == -1:
fish = 6
initial.append(9)
initial[index] = fish
index += 1
print(len(initial))
Dag 5, del 2:
straight_lines = []
diagonal_lines = []
x_values = []
y_values = []
with open("input_day5.txt", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
x1 = int(f[:f.index(",")])
y1 = int(f[f.index(",")+1:f.index(" -> ")])
x2 = int(f[f.index(" -> ")+4:f.index(",",f.index(" -> ")+4)])
y2 = int(f[f.index(",",f.index(" -> "))+1:])
x_values.append(x1)
x_values.append(x2)
y_values.append(y1)
y_values.append(y2)
if x1 == x2 or y1 == y2:
straight_lines.append([(x1, y1), (x2, y2)])
elif x1 != x2 and y1 != y2:
diagonal_lines.append([(x1, y1), (x2, y2)])
coordinates = {}
for x in range(max(x_values)+1):
for y in range(max(y_values)+1):
coordinates[str(x) + "," + str(y)] = 0
def add_line_to_coordinates(x,y):
key = str(x) + "," + str(y)
coordinates[key] += 1
for line in diagonal_lines:
if line[0][0] > line[1][0] and line[0][1] > line[1][1]:
number_of_coordinates = line[0][0] - line[1][0]
for i in range(number_of_coordinates + 1):
add_line_to_coordinates(line[1][0] + i, line[1][1] + i)
elif line[0][0] > line[1][0] and line[0][1] < line[1][1]:
number_of_coordinates = line[0][0] - line[1][0]
for i in range(number_of_coordinates + 1):
add_line_to_coordinates(line[1][0] + i, line[1][1] - i)
elif line[0][0] < line[1][0] and line[0][1] > line[1][1]:
number_of_coordinates = line[1][0] - line[0][0]
for i in range(number_of_coordinates + 1):
add_line_to_coordinates(line[0][0] + i, line[0][1] - i)
elif line[0][0] < line[1][0] and line[0][1] < line[1][1]:
number_of_coordinates = line[1][0] - line[0][0]
for i in range(number_of_coordinates + 1):
add_line_to_coordinates(line[0][0] + i, line[0][1] + i)
for line in straight_lines:
if line[0][0] == line[1][0]: # x values are equal
if line[0][1] < line[1][1]: # first y value is lowest
for i in range(line[0][1], line[1][1]+1):
add_line_to_coordinates(line[0][0], i)
elif line[0][1] > line[1][1]: # second y value is lowest
for i in range(line[1][1], line[0][1]+1):
add_line_to_coordinates(line[0][0], i)
else: # y values are equal, so only one point
add_line_to_coordinates(line[0][0], line[0][1])
else: # y values are equeal
if line[0][0] < line[1][0]: # first x value is lowest
for i in range(line[0][0], line[1][0]+1):
add_line_to_coordinates(i, line[0][1])
elif line[0][0] > line[1][0]: # second x value is lowest
for i in range(line[1][0], line[0][0]+1):
add_line_to_coordinates(i, line[0][1])
else:
add_line_to_coordinates(line[0][0], line[0][1])
double_hits = 0
for coordinate, number_of_hits in coordinates.items():
if number_of_hits > 1:
double_hits += 1
print(double_hits)
Dag 5, del 1:
straight_lines = []
x_values = []
y_values = []
with open("input_day5.txt", "r", encoding="utf8") as fin:
for f in fin:
f = f.replace("\n","")
x1 = int(f[:f.index(",")])
y1 = int(f[f.index(",")+1:f.index(" -> ")])
x2 = int(f[f.index(" -> ")+4:f.index(",",f.index(" -> ")+4)])
y2 = int(f[f.index(",",f.index(" -> "))+1:])
if x1 == x2 or y1 == y2:
x_values.append(x1)
x_values.append(x2)
y_values.append(y1)
y_values.append(y2)
straight_lines.append([(x1, y1), (x2, y2)])
coordinates = {}
for x in range(max(x_values)+1):
for y in range(max(y_values)+1):
coordinates[str(x) + "," + str(y)] = 0
def add_line_to_coordinates(x,y):
key = str(x) + "," + str(y)
coordinates[key] += 1
for line in straight_lines:
if line[0][0] == line[1][0]: # x values are equal
if line[0][1] < line[1][1]: # first y value is lowest
for i in range(line[0][1], line[1][1]+1):
add_line_to_coordinates(line[0][0], i)
elif line[0][1] > line[1][1]: # second y value is lowest
for i in range(line[1][1], line[0][1]+1):
add_line_to_coordinates(line[0][0], i)
else: # y values are equal, so only one point
add_line_to_coordinates(line[0][0], line[0][1])
else: # y values are equeal
if line[0][0] < line[1][0]: # first x value is lowest
for i in range(line[0][0], line[1][0]+1):
add_line_to_coordinates(i, line[0][1])
elif line[0][0] > line[1][0]: # second x value is lowest
for i in range(line[1][0], line[0][0]+1):
add_line_to_coordinates(i, line[0][1])
else:
add_line_to_coordinates(line[0][0], line[0][1])
double_hits = 0
for coordinate, number_of_hits in coordinates.items():
if number_of_hits > 1:
double_hits += 1
print(double_hits)
Dag 4, del 2:
boards = []
with open("input_day4.txt", "r", encoding="utf8") as fin:
counter = 0
sub_counter = 0
board = []
for f in fin:
if counter == 0:
f = f.replace("\n","")
drawn_numbers = f.split(",")
elif f == '\n':
sub_counter = 0
board = []
else:
if f[0] == " ":
f = f[1:]
if " " in f:
f = f.replace(" "," ")
f = f.replace("\n","")
board.extend(f.split(" "))
sub_counter += 1
if sub_counter == 5:
board = [b.replace("\n","") for b in board]
boards.append(board)
counter = 1
def check_board(board):
i = 0
while i < 26:
d_count = 0
for number in board[i:i+5]:
if 'd' in number:
d_count += 1
if d_count == 5:
return True
i += 5
row = 0
while row < 5:
i = row
d_count = 0
while i < row + 25:
if 'd' in board[i]:
d_count += 1
if d_count == 5:
return True
i += 5
row += 1
def calculate_score(board, draw):
sum_of_numbers = 0
for number in board:
if not 'd' in number:
sum_of_numbers += int(number)
return sum_of_numbers * int(draw)
winning_boards = []
scores = []
draw_counter = 0
end_loop = False
for draw in drawn_numbers:
board_counter = 0
for board in boards:
if board not in winning_boards:
number_counter = 0
for number in board:
if number == draw:
boards[board_counter][number_counter] += 'd'
number_counter += 1
bingo = check_board(board)
if bingo == True:
winning_boards.append(board)
scores.append(calculate_score(board, draw))
board_counter += 1
draw_counter += 1
print(scores[-1])
Dag 4, del 1:
boards = []
with open("input_day4.txt", "r", encoding="utf8") as fin:
counter = 0
sub_counter = 0
board = []
for f in fin:
if counter == 0:
f = f.replace("\n","")
drawn_numbers = f.split(",")
elif f == '\n':
sub_counter = 0
board = []
else:
if f[0] == " ":
f = f[1:]
if " " in f:
f = f.replace(" "," ")
f = f.replace("\n","")
board.extend(f.split(" "))
sub_counter += 1
if sub_counter == 5:
board = [b.replace("\n","") for b in board]
boards.append(board)
counter = 1
def check_board(board):
i = 0
while i < 26:
d_count = 0
for number in board[i:i+5]:
if 'd' in number:
d_count += 1
if d_count == 5:
return True
i += 5
row = 0
while row < 5:
i = row
d_count = 0
while i < row + 25:
if 'd' in board[i]:
d_count += 1
if d_count == 5:
return True
i += 5
row += 1
def calculate_score(board, draw):
sum_of_numbers = 0
for number in board:
if not 'd' in number:
sum_of_numbers += int(number)
return sum_of_numbers * int(draw)
def play_bingo():
draw_counter = 0
end_loop = False
for draw in drawn_numbers:
board_counter = 0
for board in boards:
number_counter = 0
for number in board:
if number == draw:
boards[board_counter][number_counter] += 'd'
number_counter += 1
bingo = check_board(board)
if bingo == True:
return calculate_score(board, draw)
board_counter += 1
draw_counter += 1
score = play_bingo()
print(score)
Dag 3, del 2:
rates = []
with open("input_day3", "r", encoding="utf8") as fin:
for f in fin:
rates.append(f)
oxygen_rates = rates
co2_rates = rates
for i in range(len(rates[0])-1):
zero_count = 0
one_count = 0
for rate in oxygen_rates:
if rate[i] == '0':
zero_count += 1
elif rate[i] == '1':
one_count += 1
if zero_count > one_count:
oxygen_rates = [rate for rate in oxygen_rates if rate[i] == '0']
elif one_count > zero_count or one_count == zero_count:
oxygen_rates = [rate for rate in oxygen_rates if rate[i] == '1']
if len(oxygen_rates) == 1:
oxygen = oxygen_rates[0]
zero_count = 0
one_count = 0
for rate in co2_rates:
if rate[i] == '0':
zero_count += 1
elif rate[i] == '1':
one_count += 1
if zero_count > one_count:
co2_rates = [rate for rate in co2_rates if rate[i] == '1']
elif one_count > zero_count or one_count == zero_count:
co2_rates = [rate for rate in co2_rates if rate[i] == '0']
if len(co2_rates) == 1:
co2 = co2_rates[0]
print(int(oxygen,2)*int(co2,2))
Dag 3, del 1:
rates = []
with open("input_day3", "r", encoding="utf8") as fin:
for f in fin:
rates.append(f)
gamma_rate = ""
epsilon_rate = ""
for i in range(len(rates[0])-1):
zero_count = 0
one_count = 0
for rate in rates:
if int(rate[i]) == 0:
zero_count += 1
elif int(rate[i]) == 1:
one_count += 1
if zero_count > one_count:
gamma_rate += '0'
epsilon_rate += '1'
else:
gamma_rate += '1'
epsilon_rate += '0'
print(int(gamma_rate,2) * int(epsilon_rate,2))
Dag 2, del 2:
increase_count = 0
loop_count = 0
position_list = []
with open("input_day2.txt", "r", encoding="utf8") as fin:
for f in fin:
position_list.append(f)
horisontal_position = 0
aim = 0
depth = 0
for move in position_list:
if 'forward ' in move:
number = int(move.replace('forward ',''))
horisontal_position += number
if aim > 0:
depth += number * aim
elif 'down ' in move:
number = int(move.replace('down ',''))
aim += number
elif 'up ' in move:
number = int(move.replace('up ',''))
aim -= number
else:
breakpoint()
print(horisontal_position*depth)
Dag 2, del 1:
increase_count = 0
loop_count = 0
position_list = []
with open("input_day2.txt", "r", encoding="utf8") as fin:
for f in fin:
position_list.append(f)
forward_position = 0
depth = 0
for move in position_list:
if 'forward ' in move:
number = int(move.replace('forward ',''))
forward_position += number
elif 'down ' in move:
number = int(move.replace('down ',''))
depth += number
elif 'up ' in move:
number = int(move.replace('up ',''))
depth -= number
else:
breakpoint()
print(forward_position*depth)
Dag 1, del 2:
increase_count = 0
loop_count = 0
number_list = []
with open("input.txt", "r", encoding="utf8") as fin:
for f in fin:
number_list.append(int(f))
index_start = 0
index_end = 3
while index_end <= len(number_list):
print(number_list[index_start:index_end])
if loop_count == 0:
last_sum = sum(number_list[index_start:index_end])
loop_count += 1
index_start += 1
index_end += 1
else:
new_sum = sum(number_list[index_start:index_end])
if new_sum > last_sum:
increase_count += 1
index_start += 1
index_end += 1
last_sum = new_sum
print(increase_count)
Dag 1, del 1:
increase_count = 0
loop_count = 0
with open("input.txt", "r", encoding="utf8") as fin:
for f in fin:
number = int(f)
if loop_count == 0:
last_number = number
loop_count += 1
continue
else:
if number > last_number:
increase_count += 1
last_number = number
print(increase_count)