Datasets:

Chemin-AI
/

advent_of_code_ecv_dataset

@@ -1,592 +0,0 @@
-Year,Day,Part,prompt,Solution,Language,Test Cases
-2024,1,1,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?",solution 1,Python,"[[""/test_cases/day1/test_case_1_input.txt"",""/test_cases/day1/test_case_1_output.txt""],
-     [""/test_cases/day1/test_case_2_input.txt"",""/test_cases/day1/test_case_2_output.txt""],
-     [""/test_cases/day1/test_case_3_input.txt"",""/test_cases/day1/test_case_3_output.txt""]]"
-2024,1,1,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?",solution2,Python,"[[""/test_cases/day1/test_case_1_input.txt"",""/test_cases/day1/test_case_1_output.txt""],
-     [""/test_cases/day1/test_case_2_input.txt"",""/test_cases/day1/test_case_2_output.txt""],
-     [""/test_cases/day1/test_case_3_input.txt"",""/test_cases/day1/test_case_3_output.txt""]]"
-2024,1,1,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?",solution3,Python,"[[""/test_cases/day1/test_case_1_input.txt"",""/test_cases/day1/test_case_1_output.txt""],
-     [""/test_cases/day1/test_case_2_input.txt"",""/test_cases/day1/test_case_2_output.txt""],
-     [""/test_cases/day1/test_case_3_input.txt"",""/test_cases/day1/test_case_3_output.txt""]]"
-2024,1,2,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?
-Your puzzle answer was {part1_answer}.
---- Part Two ---
-Your analysis only confirmed what everyone feared: the two lists of location IDs are indeed very different.
-Or are they?
-The Historians can't agree on which group made the mistakes or how to read most of the Chief's handwriting, but in the commotion you notice an interesting detail: a lot of location IDs appear in both lists! Maybe the other numbers aren't location IDs at all but rather misinterpreted handwriting.
-This time, you'll need to figure out exactly how often each number from the left list appears in the right list. Calculate a total similarity score by adding up each number in the left list after multiplying it by the number of times that number appears in the right list.
-Here are the same example lists again:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-For these example lists, here is the process of finding the similarity score:
-The first number in the left list is 3. It appears in the right list three times, so the similarity score increases by 3 * 3 = 9.
-The second number in the left list is 4. It appears in the right list once, so the similarity score increases by 4 * 1 = 4.
-The third number in the left list is 2. It does not appear in the right list, so the similarity score does not increase (2 * 0 = 0).
-The fourth number, 1, also does not appear in the right list.
-The fifth number, 3, appears in the right list three times; the similarity score increases by 9.
-The last number, 3, appears in the right list three times; the similarity score again increases by 9.
-So, for these example lists, the similarity score at the end of this process is 31 (9 + 4 + 0 + 0 + 9 + 9).
-Once again consider your left and right lists. What is their similarity score?",solution 1,Python,"[[""/test_cases/day2/test_case_1_input.txt"",""/test_cases/day2/test_case_1_output.txt""],
-     [""/test_cases/day2/test_case_2_input.txt"",""/test_cases/day2/test_case_2_output.txt""],
-     [""/test_cases/day2/test_case_3_input.txt"",""/test_cases/day2/test_case_3_output.txt""]]"
-2024,1,2,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?
-Your puzzle answer was {part1_answer}.
---- Part Two ---
-Your analysis only confirmed what everyone feared: the two lists of location IDs are indeed very different.
-Or are they?
-The Historians can't agree on which group made the mistakes or how to read most of the Chief's handwriting, but in the commotion you notice an interesting detail: a lot of location IDs appear in both lists! Maybe the other numbers aren't location IDs at all but rather misinterpreted handwriting.
-This time, you'll need to figure out exactly how often each number from the left list appears in the right list. Calculate a total similarity score by adding up each number in the left list after multiplying it by the number of times that number appears in the right list.
-Here are the same example lists again:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-For these example lists, here is the process of finding the similarity score:
-The first number in the left list is 3. It appears in the right list three times, so the similarity score increases by 3 * 3 = 9.
-The second number in the left list is 4. It appears in the right list once, so the similarity score increases by 4 * 1 = 4.
-The third number in the left list is 2. It does not appear in the right list, so the similarity score does not increase (2 * 0 = 0).
-The fourth number, 1, also does not appear in the right list.
-The fifth number, 3, appears in the right list three times; the similarity score increases by 9.
-The last number, 3, appears in the right list three times; the similarity score again increases by 9.
-So, for these example lists, the similarity score at the end of this process is 31 (9 + 4 + 0 + 0 + 9 + 9).
-Once again consider your left and right lists. What is their similarity score?",solution2,Python,"[[""/test_cases/day2/test_case_1_input.txt"",""/test_cases/day2/test_case_1_output.txt""],
-     [""/test_cases/day2/test_case_2_input.txt"",""/test_cases/day2/test_case_2_output.txt""],
-     [""/test_cases/day2/test_case_3_input.txt"",""/test_cases/day2/test_case_3_output.txt""]]"
-2024,1,2,"--- Day 1: Historian Hysteria ---
-The Chief Historian is always present for the big Christmas sleigh launch, but nobody has seen him in months! Last anyone heard, he was visiting locations that are historically significant to the North Pole; a group of Senior Historians has asked you to accompany them as they check the places they think he was most likely to visit.
-As each location is checked, they will mark it on their list with a star. They figure the Chief Historian must be in one of the first fifty places they'll look, so in order to save Christmas, you need to help them get fifty stars on their list before Santa takes off on December 25th.
-Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
-You haven't even left yet and the group of Elvish Senior Historians has already hit a problem: their list of locations to check is currently empty. Eventually, someone decides that the best place to check first would be the Chief Historian's office.
-Upon pouring into the office, everyone confirms that the Chief Historian is indeed nowhere to be found. Instead, the Elves discover an assortment of notes and lists of historically significant locations! This seems to be the planning the Chief Historian was doing before he left. Perhaps these notes can be used to determine which locations to search?
-Throughout the Chief's office, the historically significant locations are listed not by name but by a unique number called the location ID. To make sure they don't miss anything, The Historians split into two groups, each searching the office and trying to create their own complete list of location IDs.
-There's just one problem: by holding the two lists up side by side (your puzzle input), it quickly becomes clear that the lists aren't very similar. Maybe you can help The Historians reconcile their lists?
-For example:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-Maybe the lists are only off by a small amount! To find out, pair up the numbers and measure how far apart they are. Pair up the smallest number in the left list with the smallest number in the right list, then the second-smallest left number with the second-smallest right number, and so on.
-Within each pair, figure out how far apart the two numbers are; you'll need to add up all of those distances. For example, if you pair up a 3 from the left list with a 7 from the right list, the distance apart is 4; if you pair up a 9 with a 3, the distance apart is 6.
-In the example list above, the pairs and distances would be as follows:
-The smallest number in the left list is 1, and the smallest number in the right list is 3. The distance between them is 2.
-The second-smallest number in the left list is 2, and the second-smallest number in the right list is another 3. The distance between them is 1.
-The third-smallest number in both lists is 3, so the distance between them is 0.
-The next numbers to pair up are 3 and 4, a distance of 1.
-The fifth-smallest numbers in each list are 3 and 5, a distance of 2.
-Finally, the largest number in the left list is 4, while the largest number in the right list is 9; these are a distance 5 apart.
-To find the total distance between the left list and the right list, add up the distances between all of the pairs you found. In the example above, this is 2 + 1 + 0 + 1 + 2 + 5, a total distance of 11!
-Your actual left and right lists contain many location IDs. What is the total distance between your lists?
-Your puzzle answer was {part1_answer}.
---- Part Two ---
-Your analysis only confirmed what everyone feared: the two lists of location IDs are indeed very different.
-Or are they?
-The Historians can't agree on which group made the mistakes or how to read most of the Chief's handwriting, but in the commotion you notice an interesting detail: a lot of location IDs appear in both lists! Maybe the other numbers aren't location IDs at all but rather misinterpreted handwriting.
-This time, you'll need to figure out exactly how often each number from the left list appears in the right list. Calculate a total similarity score by adding up each number in the left list after multiplying it by the number of times that number appears in the right list.
-Here are the same example lists again:
-3   4
-4   3
-2   5
-1   3
-3   9
-3   3
-For these example lists, here is the process of finding the similarity score:
-The first number in the left list is 3. It appears in the right list three times, so the similarity score increases by 3 * 3 = 9.
-The second number in the left list is 4. It appears in the right list once, so the similarity score increases by 4 * 1 = 4.
-The third number in the left list is 2. It does not appear in the right list, so the similarity score does not increase (2 * 0 = 0).
-The fourth number, 1, also does not appear in the right list.
-The fifth number, 3, appears in the right list three times; the similarity score increases by 9.
-The last number, 3, appears in the right list three times; the similarity score again increases by 9.
-So, for these example lists, the similarity score at the end of this process is 31 (9 + 4 + 0 + 0 + 9 + 9).
-Once again consider your left and right lists. What is their similarity score?",solution3,Python,"[[""/test_cases/day2/test_case_1_input.txt"",""/test_cases/day2/test_case_1_output.txt""],
-     [""/test_cases/day2/test_case_2_input.txt"",""/test_cases/day2/test_case_2_output.txt""],
-     [""/test_cases/day2/test_case_3_input.txt"",""/test_cases/day2/test_case_3_output.txt""]]"
-2024,12,1,"--- Day 12: Garden Groups ---
-Why not search for the Chief Historian near the gardener and his massive farm? There's plenty of food, so The Historians grab something to eat while they search.
-You're about to settle near a complex arrangement of garden plots when some Elves ask if you can lend a hand. They'd like to set up fences around each region of garden plots, but they can't figure out how much fence they need to order or how much it will cost. They hand you a map (your puzzle input) of the garden plots.
-Each garden plot grows only a single type of plant and is indicated by a single letter on your map. When multiple garden plots are growing the same type of plant and are touching (horizontally or vertically), they form a region. For example:
-AAAA
-BBCD
-BBCC
-EEEC
-This 4x4 arrangement includes garden plots growing five different types of plants (labeled A, B, C, D, and E), each grouped into their own region.
-In order to accurately calculate the cost of the fence around a single region, you need to know that region's area and perimeter.
-The area of a region is simply the number of garden plots the region contains. The above map's type A, B, and C plants are each in a region of area 4. The type E plants are in a region of area 3; the type D plants are in a region of area 1.
-Each garden plot is a square and so has four sides. The perimeter of a region is the number of sides of garden plots in the region that do not touch another garden plot in the same region. The type A and C plants are each in a region with perimeter 10. The type B and E plants are each in a region with perimeter 8. The lone D plot forms its own region with perimeter 4.
-Visually indicating the sides of plots in each region that contribute to the perimeter using - and |, the above map's regions' perimeters are measured as follows:
-+-+-+-+-+
-|A A A A|
-+-+-+-+-+     +-+
-              |D|
-+-+-+   +-+   +-+
-|B B|   |C|
-+   +   + +-+
-|B B|   |C C|
-+-+-+   +-+ +
-          |C|
-+-+-+-+   +-+
-|E E E|
-+-+-+-+
-Plants of the same type can appear in multiple separate regions, and regions can even appear within other regions. For example:
-OOOOO
-OXOXO
-OOOOO
-OXOXO
-OOOOO
-The above map contains five regions, one containing all of the O garden plots, and the other four each containing a single X plot.
-The four X regions each have area 1 and perimeter 4. The region containing 21 type O plants is more complicated; in addition to its outer edge contributing a perimeter of 20, its boundary with each X region contributes an additional 4 to its perimeter, for a total perimeter of 36.
-Due to ""modern"" business practices, the price of fence required for a region is found by multiplying that region's area by its perimeter. The total price of fencing all regions on a map is found by adding together the price of fence for every region on the map.
-In the first example, region A has price 4 * 10 = 40, region B has price 4 * 8 = 32, region C has price 4 * 10 = 40, region D has price 1 * 4 = 4, and region E has price 3 * 8 = 24. So, the total price for the first example is 140.
-In the second example, the region with all of the O plants has price 21 * 36 = 756, and each of the four smaller X regions has price 1 * 4 = 4, for a total price of 772 (756 + 4 + 4 + 4 + 4).
-Here's a larger example:
-RRRRIICCFF
-RRRRIICCCF
-VVRRRCCFFF
-VVRCCCJFFF
-VVVVCJJCFE
-VVIVCCJJEE
-VVIIICJJEE
-MIIIIIJJEE
-MIIISIJEEE
-MMMISSJEEE
-It contains:
-A region of R plants with price 12 * 18 = 216.
-A region of I plants with price 4 * 8 = 32.
-A region of C plants with price 14 * 28 = 392.
-A region of F plants with price 10 * 18 = 180.
-A region of V plants with price 13 * 20 = 260.
-A region of J plants with price 11 * 20 = 220.
-A region of C plants with price 1 * 4 = 4.
-A region of E plants with price 13 * 18 = 234.
-A region of I plants with price 14 * 22 = 308.
-A region of M plants with price 5 * 12 = 60.
-A region of S plants with price 3 * 8 = 24.
-So, it has a total price of 1930.
-What is the total price of fencing all regions on your map?
-",solution1,Python,"[[""/test_cases/day12/test_case_1_input.txt"",""/test_cases/day12/test_case_1_output.txt""],
-     [""/test_cases/day12/test_case_2_input.txt"",""/test_cases/day12/test_case_2_output.txt""],
-     [""/test_cases/day12/test_case_3_input.txt"",""/test_cases/day12/test_case_3_output.txt""]]"
-2024,12,1,"--- Day 12: Garden Groups ---
-Why not search for the Chief Historian near the gardener and his massive farm? There's plenty of food, so The Historians grab something to eat while they search.
-You're about to settle near a complex arrangement of garden plots when some Elves ask if you can lend a hand. They'd like to set up fences around each region of garden plots, but they can't figure out how much fence they need to order or how much it will cost. They hand you a map (your puzzle input) of the garden plots.
-Each garden plot grows only a single type of plant and is indicated by a single letter on your map. When multiple garden plots are growing the same type of plant and are touching (horizontally or vertically), they form a region. For example:
-AAAA
-BBCD
-BBCC
-EEEC
-This 4x4 arrangement includes garden plots growing five different types of plants (labeled A, B, C, D, and E), each grouped into their own region.
-In order to accurately calculate the cost of the fence around a single region, you need to know that region's area and perimeter.
-The area of a region is simply the number of garden plots the region contains. The above map's type A, B, and C plants are each in a region of area 4. The type E plants are in a region of area 3; the type D plants are in a region of area 1.
-Each garden plot is a square and so has four sides. The perimeter of a region is the number of sides of garden plots in the region that do not touch another garden plot in the same region. The type A and C plants are each in a region with perimeter 10. The type B and E plants are each in a region with perimeter 8. The lone D plot forms its own region with perimeter 4.
-Visually indicating the sides of plots in each region that contribute to the perimeter using - and |, the above map's regions' perimeters are measured as follows:
-+-+-+-+-+
-|A A A A|
-+-+-+-+-+     +-+
-              |D|
-+-+-+   +-+   +-+
-|B B|   |C|
-+   +   + +-+
-|B B|   |C C|
-+-+-+   +-+ +
-          |C|
-+-+-+-+   +-+
-|E E E|
-+-+-+-+
-Plants of the same type can appear in multiple separate regions, and regions can even appear within other regions. For example:
-OOOOO
-OXOXO
-OOOOO
-OXOXO
-OOOOO
-The above map contains five regions, one containing all of the O garden plots, and the other four each containing a single X plot.
-The four X regions each have area 1 and perimeter 4. The region containing 21 type O plants is more complicated; in addition to its outer edge contributing a perimeter of 20, its boundary with each X region contributes an additional 4 to its perimeter, for a total perimeter of 36.
-Due to ""modern"" business practices, the price of fence required for a region is found by multiplying that region's area by its perimeter. The total price of fencing all regions on a map is found by adding together the price of fence for every region on the map.
-In the first example, region A has price 4 * 10 = 40, region B has price 4 * 8 = 32, region C has price 4 * 10 = 40, region D has price 1 * 4 = 4, and region E has price 3 * 8 = 24. So, the total price for the first example is 140.
-In the second example, the region with all of the O plants has price 21 * 36 = 756, and each of the four smaller X regions has price 1 * 4 = 4, for a total price of 772 (756 + 4 + 4 + 4 + 4).
-Here's a larger example:
-RRRRIICCFF
-RRRRIICCCF
-VVRRRCCFFF
-VVRCCCJFFF
-VVVVCJJCFE
-VVIVCCJJEE
-VVIIICJJEE
-MIIIIIJJEE
-MIIISIJEEE
-MMMISSJEEE
-It contains:
-A region of R plants with price 12 * 18 = 216.
-A region of I plants with price 4 * 8 = 32.
-A region of C plants with price 14 * 28 = 392.
-A region of F plants with price 10 * 18 = 180.
-A region of V plants with price 13 * 20 = 260.
-A region of J plants with price 11 * 20 = 220.
-A region of C plants with price 1 * 4 = 4.
-A region of E plants with price 13 * 18 = 234.
-A region of I plants with price 14 * 22 = 308.
-A region of M plants with price 5 * 12 = 60.
-A region of S plants with price 3 * 8 = 24.
-So, it has a total price of 1930.
-What is the total price of fencing all regions on your map?
-",solution2,Python,"[[""/test_cases/day12/test_case_1_input.txt"",""/test_cases/day12/test_case_1_output.txt""],
-     [""/test_cases/day12/test_case_2_input.txt"",""/test_cases/day12/test_case_2_output.txt""],
-     [""/test_cases/day12/test_case_3_input.txt"",""/test_cases/day12/test_case_3_output.txt""]]"
-2024,12,1,"--- Day 12: Garden Groups ---
-Why not search for the Chief Historian near the gardener and his massive farm? There's plenty of food, so The Historians grab something to eat while they search.
-You're about to settle near a complex arrangement of garden plots when some Elves ask if you can lend a hand. They'd like to set up fences around each region of garden plots, but they can't figure out how much fence they need to order or how much it will cost. They hand you a map (your puzzle input) of the garden plots.
-Each garden plot grows only a single type of plant and is indicated by a single letter on your map. When multiple garden plots are growing the same type of plant and are touching (horizontally or vertically), they form a region. For example:
-AAAA
-BBCD
-BBCC
-EEEC
-This 4x4 arrangement includes garden plots growing five different types of plants (labeled A, B, C, D, and E), each grouped into their own region.
-In order to accurately calculate the cost of the fence around a single region, you need to know that region's area and perimeter.
-The area of a region is simply the number of garden plots the region contains. The above map's type A, B, and C plants are each in a region of area 4. The type E plants are in a region of area 3; the type D plants are in a region of area 1.
-Each garden plot is a square and so has four sides. The perimeter of a region is the number of sides of garden plots in the region that do not touch another garden plot in the same region. The type A and C plants are each in a region with perimeter 10. The type B and E plants are each in a region with perimeter 8. The lone D plot forms its own region with perimeter 4.
-Visually indicating the sides of plots in each region that contribute to the perimeter using - and |, the above map's regions' perimeters are measured as follows:
-+-+-+-+-+
-|A A A A|
-+-+-+-+-+     +-+
-              |D|
-+-+-+   +-+   +-+
-|B B|   |C|
-+   +   + +-+
-|B B|   |C C|
-+-+-+   +-+ +
-          |C|
-+-+-+-+   +-+
-|E E E|
-+-+-+-+
-Plants of the same type can appear in multiple separate regions, and regions can even appear within other regions. For example:
-OOOOO
-OXOXO
-OOOOO
-OXOXO
-OOOOO
-The above map contains five regions, one containing all of the O garden plots, and the other four each containing a single X plot.
-The four X regions each have area 1 and perimeter 4. The region containing 21 type O plants is more complicated; in addition to its outer edge contributing a perimeter of 20, its boundary with each X region contributes an additional 4 to its perimeter, for a total perimeter of 36.
-Due to ""modern"" business practices, the price of fence required for a region is found by multiplying that region's area by its perimeter. The total price of fencing all regions on a map is found by adding together the price of fence for every region on the map.
-In the first example, region A has price 4 * 10 = 40, region B has price 4 * 8 = 32, region C has price 4 * 10 = 40, region D has price 1 * 4 = 4, and region E has price 3 * 8 = 24. So, the total price for the first example is 140.
-In the second example, the region with all of the O plants has price 21 * 36 = 756, and each of the four smaller X regions has price 1 * 4 = 4, for a total price of 772 (756 + 4 + 4 + 4 + 4).
-Here's a larger example:
-RRRRIICCFF
-RRRRIICCCF
-VVRRRCCFFF
-VVRCCCJFFF
-VVVVCJJCFE
-VVIVCCJJEE
-VVIIICJJEE
-MIIIIIJJEE
-MIIISIJEEE
-MMMISSJEEE
-It contains:
-A region of R plants with price 12 * 18 = 216.
-A region of I plants with price 4 * 8 = 32.
-A region of C plants with price 14 * 28 = 392.
-A region of F plants with price 10 * 18 = 180.
-A region of V plants with price 13 * 20 = 260.
-A region of J plants with price 11 * 20 = 220.
-A region of C plants with price 1 * 4 = 4.
-A region of E plants with price 13 * 18 = 234.
-A region of I plants with price 14 * 22 = 308.
-A region of M plants with price 5 * 12 = 60.
-A region of S plants with price 3 * 8 = 24.
-So, it has a total price of 1930.
-What is the total price of fencing all regions on your map?
-",solution3,Python,"[[""/test_cases/day12/test_case_1_input.txt"",""/test_cases/day12/test_case_1_output.txt""],
-     [""/test_cases/day12/test_case_2_input.txt"",""/test_cases/day12/test_case_2_output.txt""],
-     [""/test_cases/day12/test_case_3_input.txt"",""/test_cases/day12/test_case_3_output.txt""]]"