VAR/AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Code cleanup

Browse Source
This commit is contained in:
Valeriano A.R.
2023-12-02 18:27:00 +01:00
parent 4d8bfbb377
commit 4b3d0fd0b6
78 changed files with 6814 additions and 6950 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
.editorconfig Normal file
View File

@@ -0,0 +1,33 @@
[*]
# Microsoft .NET properties
csharp_indent_braces = false
csharp_new_line_before_members_in_object_initializers = false
csharp_new_line_before_open_brace = accessors,anonymous_methods,control_blocks,events,indexers,lambdas,local_functions,methods,properties,types
csharp_preferred_modifier_order = private, public, protected, internal, file, new, readonly, abstract, virtual, sealed, static, override, extern, unsafe, volatile, async, required:suggestion
csharp_prefer_braces = true:none
csharp_preserve_single_line_blocks = true
csharp_style_var_elsewhere = false:suggestion
csharp_style_var_for_built_in_types = false:suggestion
csharp_style_var_when_type_is_apparent = false:suggestion
dotnet_style_parentheses_in_arithmetic_binary_operators = always_for_clarity:none
dotnet_style_parentheses_in_other_binary_operators = always_for_clarity:none
dotnet_style_parentheses_in_relational_binary_operators = never_if_unnecessary:none
# ReSharper properties
resharper_accessor_owner_body = accessors_with_block_body
resharper_blank_lines_after_block_statements = 0
resharper_csharp_max_line_length = 195
resharper_csharp_remove_blank_lines_near_braces_in_code = false
resharper_instance_members_qualify_declared_in = base_class
resharper_keep_existing_declaration_block_arrangement = false
resharper_max_array_initializer_elements_on_line = 2
resharper_max_initializer_elements_on_line = 2
resharper_parentheses_non_obvious_operations = none, multiplicative, additive, arithmetic, shift, bitwise_and, bitwise_exclusive_or, bitwise_inclusive_or, bitwise
resharper_parentheses_redundancy_style = remove
resharper_parentheses_same_type_operations = true
resharper_place_simple_embedded_statement_on_same_line = true
resharper_trailing_comma_in_multiline_lists = true
resharper_wrap_array_initializer_style = chop_always
resharper_wrap_object_and_collection_initializer_style = chop_always

5
.idea/.idea.AdventOfCode/.idea/codeStyles/codeStyleConfig.xml generated Normal file
View File

@@ -0,0 +1,5 @@
<component name="ProjectCodeStyleConfiguration">
<state>
<option name="PREFERRED_PROJECT_CODE_STYLE" value="Default" />
</state>
</component>

7
AdventOfCode.sln.DotSettings Normal file
View File

@@ -0,0 +1,7 @@
<wpf:ResourceDictionary xml:space="preserve" xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml" xmlns:s="clr-namespace:System;assembly=mscorlib" xmlns:ss="urn:shemas-jetbrains-com:settings-storage-xaml" xmlns:wpf="http://schemas.microsoft.com/winfx/2006/xaml/presentation">
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/Abbreviations/=BFS/@EntryIndexedValue">BFS</s:String>
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/Abbreviations/=ID/@EntryIndexedValue">ID</s:String>
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/Abbreviations/=VM/@EntryIndexedValue">VM</s:String>
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/Abbreviations/=VX/@EntryIndexedValue">VX</s:String>
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/Abbreviations/=VY/@EntryIndexedValue">VY</s:String>
<s:String x:Key="/Default/CodeStyle/Naming/CSharpNaming/PredefinedNamingRules/=TypesAndNamespaces/@EntryIndexedValue">&lt;Policy Inspect="True" Prefix="" Suffix="" Style="AaBb_AaBb" /&gt;</s:String></wpf:ResourceDictionary>

43
AdventOfCode2017.Tests/Day01_Tests.cs
View File

@@ -1,17 +1,15 @@
using Xunit;
namespace AdventOfCode2017.Tests;
namespace AdventOfCode2017.Tests
public class Day01_Tests
{
public class Day01_Tests
{
#region ResolvePart1
[Fact]
public void ResolvePart1__Test1()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "1122", });
string result = day01.ResolvePart1(new[] { "1122", });
Assert.Equal("3", result);
}
@@ -19,9 +17,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "1111", });
string result = day01.ResolvePart1(new[] { "1111", });
Assert.Equal("4", result);
}
@@ -29,9 +27,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart1__Test3()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "1234", });
string result = day01.ResolvePart1(new[] { "1234", });
Assert.Equal("0", result);
}
@@ -39,9 +37,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart1__Test4()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "91212129", });
string result = day01.ResolvePart1(new[] { "91212129", });
Assert.Equal("9", result);
}
@@ -53,9 +51,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test1()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "1212", });
string result = day01.ResolvePart2(new[] { "1212", });
Assert.Equal("6", result);
}
@@ -63,9 +61,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test2()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "1221", });
string result = day01.ResolvePart2(new[] { "1221", });
Assert.Equal("0", result);
}
@@ -73,9 +71,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test3()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "123425", });
string result = day01.ResolvePart2(new[] { "123425", });
Assert.Equal("4", result);
}
@@ -83,9 +81,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test4()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "123123", });
string result = day01.ResolvePart2(new[] { "123123", });
Assert.Equal("12", result);
}
@@ -93,13 +91,12 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test5()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "12131415", });
string result = day01.ResolvePart2(new[] { "12131415", });
Assert.Equal("4", result);
}
#endregion ResolvePart2
}
}

15
AdventOfCode2017.Tests/Day02_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2017.Tests;
namespace AdventOfCode2017.Tests
public class Day02_Tests
{
public class Day02_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day02 day02 = new Day02();
Day02 day02 = new();
string result = day02.ResolvePart1(new string[] {
string result = day02.ResolvePart1(new[] {
"5 1 9 5",
"7 5 3",
"2 4 6 8",
@@ -21,9 +19,9 @@ namespace AdventOfCode2017.Tests
[Fact]
public void ResolvePart2__Test()
{
Day02 day02 = new Day02();
Day02 day02 = new();
string result = day02.ResolvePart2(new string[] {
string result = day02.ResolvePart2(new[] {
"5 9 2 8",
"9 4 7 3",
"3 8 6 5",
@@ -31,5 +29,4 @@ namespace AdventOfCode2017.Tests
Assert.Equal("9", result);
}
}
}

1
AdventOfCode2017.Tests/Usings.cs Normal file
View File

@@ -0,0 +1 @@
global using Xunit;

40
AdventOfCode2017/Day01.cs
View File

@@ -1,37 +1,36 @@
namespace AdventOfCode2017
{
/*
namespace AdventOfCode2017;
/*
*
--- Day 1: Inverse Captcha ---
--- Day 1: Inverse Captcha ---
The night before Christmas, one of Santa's Elves calls you in a panic. "The printer's broken! We can't print the Naughty or Nice List!" By the time you make it to sub-basement 17, there are only a few minutes until midnight. "We have a big problem," she says; "there must be almost fifty bugs in this system, but nothing else can print The List. Stand in this square, quick! There's no time to explain; if you can convince them to pay you in stars, you'll be able to--" She pulls a lever and the world goes blurry.
The night before Christmas, one of Santa's Elves calls you in a panic. "The printer's broken! We can't print the Naughty or Nice List!" By the time you make it to sub-basement 17, there are only a few minutes until midnight. "We have a big problem," she says; "there must be almost fifty bugs in this system, but nothing else can print The List. Stand in this square, quick! There's no time to explain; if you can convince them to pay you in stars, you'll be able to--" She pulls a lever and the world goes blurry.
When your eyes can focus again, everything seems a lot more pixelated than before. She must have sent you inside the computer! You check the system clock: 25 milliseconds until midnight. With that much time, you should be able to collect all fifty stars by December 25th.
When your eyes can focus again, everything seems a lot more pixelated than before. She must have sent you inside the computer! You check the system clock: 25 milliseconds until midnight. With that much time, you should be able to collect all fifty stars by December 25th.
Collect stars by solving puzzles. Two puzzles will be made available on each day millisecond in the advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
Collect stars by solving puzzles. Two puzzles will be made available on each day millisecond in the advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one star. Good luck!
You're standing in a room with "digitization quarantine" written in LEDs along one wall. The only door is locked, but it includes a small interface. "Restricted Area - Strictly No Digitized Users Allowed."
You're standing in a room with "digitization quarantine" written in LEDs along one wall. The only door is locked, but it includes a small interface. "Restricted Area - Strictly No Digitized Users Allowed."
It goes on to explain that you may only leave by solving a captcha to prove you're not a human. Apparently, you only get one millisecond to solve the captcha: too fast for a normal human, but it feels like hours to you.
It goes on to explain that you may only leave by solving a captcha to prove you're not a human. Apparently, you only get one millisecond to solve the captcha: too fast for a normal human, but it feels like hours to you.
The captcha requires you to review a sequence of digits (your puzzle input) and find the sum of all digits that match the next digit in the list. The list is circular, so the digit after the last digit is the first digit in the list.
The captcha requires you to review a sequence of digits (your puzzle input) and find the sum of all digits that match the next digit in the list. The list is circular, so the digit after the last digit is the first digit in the list.
For example:
For example:
1122 produces a sum of 3 (1 + 2) because the first digit (1) matches the second digit and the third digit (2) matches the fourth digit.
1111 produces 4 because each digit (all 1) matches the next.
1234 produces 0 because no digit matches the next.
91212129 produces 9 because the only digit that matches the next one is the last digit, 9.
What is the solution to your captcha?
What is the solution to your captcha?
--- Part Two ---
--- Part Two ---
You notice a progress bar that jumps to 50% completion. Apparently, the door isn't yet satisfied, but it did emit a star as encouragement. The instructions change:
You notice a progress bar that jumps to 50% completion. Apparently, the door isn't yet satisfied, but it did emit a star as encouragement. The instructions change:
Now, instead of considering the next digit, it wants you to consider the digit halfway around the circular list. That is, if your list contains 10 items, only include a digit in your sum if the digit 10/2 = 5 steps forward matches it. Fortunately, your list has an even number of elements.
Now, instead of considering the next digit, it wants you to consider the digit halfway around the circular list. That is, if your list contains 10 items, only include a digit in your sum if the digit 10/2 = 5 steps forward matches it. Fortunately, your list has an even number of elements.
For example:
For example:
1212 produces 6: the list contains 4 items, and all four digits match the digit 2 items ahead.
1221 produces 0, because every comparison is between a 1 and a 2.
@@ -39,12 +38,12 @@
123123 produces 12.
12131415 produces 4.
What is the solution to your new captcha?
What is the solution to your new captcha?
*/
*/
public class Day01 : IDay
{
public class Day01 : IDay
{
public string ResolvePart1(string[] inputs)
{
string input = inputs[0];
@@ -76,5 +75,4 @@
}
return value.ToString();
}
}
}

57
AdventOfCode2017/Day02.cs
View File

@@ -1,66 +1,62 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2017
{
/*
namespace AdventOfCode2017;
/*
--- Day 2: Corruption Checksum ---
--- Day 2: Corruption Checksum ---
As you walk through the door, a glowing humanoid shape yells in your direction. "You there! Your state appears to be idle. Come help us repair the corruption in this spreadsheet - if we take another millisecond, we'll have to display an hourglass cursor!"
As you walk through the door, a glowing humanoid shape yells in your direction. "You there! Your state appears to be idle. Come help us repair the corruption in this spreadsheet - if we take another millisecond, we'll have to display an hourglass cursor!"
The spreadsheet consists of rows of apparently-random numbers. To make sure the recovery process is on the right track, they need you to calculate the spreadsheet's checksum. For each row, determine the difference between the largest value and the smallest value; the checksum is the sum of all of these differences.
The spreadsheet consists of rows of apparently-random numbers. To make sure the recovery process is on the right track, they need you to calculate the spreadsheet's checksum. For each row, determine the difference between the largest value and the smallest value; the checksum is the sum of all of these differences.
For example, given the following spreadsheet:
For example, given the following spreadsheet:
5 1 9 5
7 5 3
2 4 6 8
5 1 9 5
7 5 3
2 4 6 8
The first row's largest and smallest values are 9 and 1, and their difference is 8.
The second row's largest and smallest values are 7 and 3, and their difference is 4.
The third row's difference is 6.
In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18.
In this example, the spreadsheet's checksum would be 8 + 4 + 6 = 18.
What is the checksum for the spreadsheet in your puzzle input?
What is the checksum for the spreadsheet in your puzzle input?
--- Part Two ---
--- Part Two ---
"Great work; looks like we're on the right track after all. Here's a star for your effort." However, the program seems a little worried. Can programs be worried?
"Great work; looks like we're on the right track after all. Here's a star for your effort." However, the program seems a little worried. Can programs be worried?
"Based on what we're seeing, it looks like all the User wanted is some information about the evenly divisible values in the spreadsheet. Unfortunately, none of us are equipped for that kind of calculation - most of us specialize in bitwise operations."
"Based on what we're seeing, it looks like all the User wanted is some information about the evenly divisible values in the spreadsheet. Unfortunately, none of us are equipped for that kind of calculation - most of us specialize in bitwise operations."
It sounds like the goal is to find the only two numbers in each row where one evenly divides the other - that is, where the result of the division operation is a whole number. They would like you to find those numbers on each line, divide them, and add up each line's result.
It sounds like the goal is to find the only two numbers in each row where one evenly divides the other - that is, where the result of the division operation is a whole number. They would like you to find those numbers on each line, divide them, and add up each line's result.
For example, given the following spreadsheet:
For example, given the following spreadsheet:
5 9 2 8
9 4 7 3
3 8 6 5
5 9 2 8
9 4 7 3
3 8 6 5
In the first row, the only two numbers that evenly divide are 8 and 2; the result of this division is 4.
In the second row, the two numbers are 9 and 3; the result is 3.
In the third row, the result is 2.
In this example, the sum of the results would be 4 + 3 + 2 = 9.
In this example, the sum of the results would be 4 + 3 + 2 = 9.
What is the sum of each row's result in your puzzle input?
What is the sum of each row's result in your puzzle input?
*/
*/
public class Day02 : IDay
{
public class Day02 : IDay
{
public string ResolvePart1(string[] inputs)
{
int checksum = 0;
foreach(string input in inputs)
{
int[] row = input
.Split(new string[] { " ", " " }, StringSplitOptions.RemoveEmptyEntries)
.Split(new[] { " ", " " }, StringSplitOptions.RemoveEmptyEntries)
.Select(cell => Convert.ToInt32(cell))
.ToArray();
int max = row.Max();
@@ -76,7 +72,7 @@ namespace AdventOfCode2017
foreach (string input in inputs)
{
int[] row = input
.Split(new string[] { " ", " " }, StringSplitOptions.RemoveEmptyEntries)
.Split(new[] { " ", " " }, StringSplitOptions.RemoveEmptyEntries)
.Select(cell => Convert.ToInt32(cell))
.ToArray();
@@ -95,5 +91,4 @@ namespace AdventOfCode2017
}
return checksum.ToString();
}
}
}

39
AdventOfCode2017/Day03.cs
View File

@@ -1,39 +1,33 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2017;
namespace AdventOfCode2017
{
/*
/*
*
--- Day 3: Spiral Memory ---
--- Day 3: Spiral Memory ---
You come across an experimental new kind of memory stored on an infinite two-dimensional grid.
You come across an experimental new kind of memory stored on an infinite two-dimensional grid.
Each square on the grid is allocated in a spiral pattern starting at a location marked 1 and then counting up while spiraling outward. For example, the first few squares are allocated like this:
Each square on the grid is allocated in a spiral pattern starting at a location marked 1 and then counting up while spiraling outward. For example, the first few squares are allocated like this:
17 16 15 14 13
18 5 4 3 12
19 6 1 2 11
20 7 8 9 10
21 22 23---> ...
17 16 15 14 13
18 5 4 3 12
19 6 1 2 11
20 7 8 9 10
21 22 23---> ...
While this is very space-efficient (no squares are skipped), requested data must be carried back to square 1 (the location of the only access port for this memory system) by programs that can only move up, down, left, or right. They always take the shortest path: the Manhattan Distance between the location of the data and square 1.
While this is very space-efficient (no squares are skipped), requested data must be carried back to square 1 (the location of the only access port for this memory system) by programs that can only move up, down, left, or right. They always take the shortest path: the Manhattan Distance between the location of the data and square 1.
For example:
For example:
Data from square 1 is carried 0 steps, since it's at the access port.
Data from square 12 is carried 3 steps, such as: down, left, left.
Data from square 23 is carried only 2 steps: up twice.
Data from square 1024 must be carried 31 steps.
How many steps are required to carry the data from the square identified in your puzzle input all the way to the access port?
How many steps are required to carry the data from the square identified in your puzzle input all the way to the access port?
*/
public class Day03 : IDay
{
*/
public class Day03 : IDay
{
public string ResolvePart1(string[] inputs)
{
return null;
@@ -43,5 +37,4 @@ namespace AdventOfCode2017
{
return null;
}
}
}

7
AdventOfCode2017/IDay.cs
View File

@@ -1,8 +1,7 @@
namespace AdventOfCode2017
namespace AdventOfCode2017;
public interface IDay
{
public interface IDay
{
string ResolvePart1(string[] inputs);
string ResolvePart2(string[] inputs);
}
}

11
AdventOfCode2017/Program.cs
View File

@@ -1,11 +1,11 @@
using System;
using System.IO;
namespace AdventOfCode2017
namespace AdventOfCode2017;
public class Program
{
public class Program
{
private static void Main(string[] args)
private static void Main()
{
int currentDayNumber = 3;
IDay currentDay = null;
@@ -17,7 +17,7 @@ namespace AdventOfCode2017
case 3: currentDay = new Day03(); break;
}
string[] linesDay = File.ReadAllLines(string.Format("inputs/Day{0:00}.txt", currentDayNumber));
string[] linesDay = File.ReadAllLines($"inputs/Day{currentDayNumber:00}.txt");
string resultPart1 = currentDay.ResolvePart1(linesDay);
Console.WriteLine("Day{1:00} Result Part1: {0}", resultPart1, currentDayNumber);
string resultPart2 = currentDay.ResolvePart2(linesDay);
@@ -25,5 +25,4 @@ namespace AdventOfCode2017
Console.Read();
}
}
}

21
AdventOfCode2018.Tests/ChronoLicenceNode_Tests.cs
View File

@@ -1,15 +1,11 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class ChronoLicenceNode_Tests
{
public class ChronoLicenceNode_Tests
{
[Fact]
public void BuildFromIntStream__Test()
{
Day08 day = new Day08();
IntStream values = new IntStream("2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2");
IntStream values = new("2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2");
ChronoLicenceNode result = ChronoLicenceNode.BuildFromIntStream(values);
Assert.Equal(2, result.Childs.Count);
@@ -18,19 +14,18 @@ namespace AdventOfCode2018.Tests
Assert.Equal(1, result.Metadata[1]);
Assert.Equal(2, result.Metadata[2]);
Assert.Equal(0, result.Childs[0].Childs.Count);
Assert.Empty(result.Childs[0].Childs);
Assert.Equal(3, result.Childs[0].Metadata.Count);
Assert.Equal(10, result.Childs[0].Metadata[0]);
Assert.Equal(11, result.Childs[0].Metadata[1]);
Assert.Equal(12, result.Childs[0].Metadata[2]);
Assert.Equal(1, result.Childs[1].Childs.Count);
Assert.Equal(1, result.Childs[1].Metadata.Count);
Assert.Single(result.Childs[1].Childs);
Assert.Single(result.Childs[1].Metadata);
Assert.Equal(2, result.Childs[1].Metadata[0]);
Assert.Equal(0, result.Childs[1].Childs[0].Childs.Count);
Assert.Equal(1, result.Childs[1].Childs[0].Metadata.Count);
Assert.Empty(result.Childs[1].Childs[0].Childs);
Assert.Single(result.Childs[1].Childs[0].Metadata);
Assert.Equal(99, result.Childs[1].Childs[0].Metadata[0]);
}
}
}

7
AdventOfCode2018.Tests/ChronoPoint_Tests.cs
View File

@@ -1,9 +1,7 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class ChronoPoint_Tests
{
public class ChronoPoint_Tests
{
#region FromString
[Fact]
@@ -60,5 +58,4 @@ namespace AdventOfCode2018.Tests
}
#endregion ManhattanDistance
}
}

13
AdventOfCode2018.Tests/Claim_Tests.cs
View File

@@ -1,9 +1,7 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Claim_Tests
{
public class Claim_Tests
{
#region FromString
[Fact]
@@ -66,7 +64,7 @@ namespace AdventOfCode2018.Tests
bool result = Day03.Claim.Overlaps(claim1, claim2);
Assert.Equal(false, result);
Assert.False(result);
}
[Fact]
@@ -77,7 +75,7 @@ namespace AdventOfCode2018.Tests
bool result = Day03.Claim.Overlaps(claim1, claim2);
Assert.Equal(false, result);
Assert.False(result);
}
[Fact]
@@ -88,9 +86,8 @@ namespace AdventOfCode2018.Tests
bool result = Day03.Claim.Overlaps(claim1, claim2);
Assert.Equal(true, result);
Assert.True(result);
}
#endregion Overlaps
}
}

43
AdventOfCode2018.Tests/Day01_Tests.cs
View File

@@ -1,17 +1,15 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day01_Tests
{
public class Day01_Tests
{
#region ResolvePart1
[Fact]
public void ResolvePart1__Test1()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "+1", "-2", "+3", "+1", });
string result = day01.ResolvePart1(new[] { "+1", "-2", "+3", "+1", });
Assert.Equal("3", result);
}
@@ -19,9 +17,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "+1", "+1", "+1", });
string result = day01.ResolvePart1(new[] { "+1", "+1", "+1", });
Assert.Equal("3", result);
}
@@ -29,9 +27,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test3()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "+1", "+1", "-2", });
string result = day01.ResolvePart1(new[] { "+1", "+1", "-2", });
Assert.Equal("0", result);
}
@@ -39,9 +37,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test4()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart1(new string[] { "-1", "-2", "-3", });
string result = day01.ResolvePart1(new[] { "-1", "-2", "-3", });
Assert.Equal("-6", result);
}
@@ -53,9 +51,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test1()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "+1", "-2", "+3", "+1", });
string result = day01.ResolvePart2(new[] { "+1", "-2", "+3", "+1", });
Assert.Equal("2", result);
}
@@ -63,9 +61,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test2()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "+1", "-1", });
string result = day01.ResolvePart2(new[] { "+1", "-1", });
Assert.Equal("0", result);
}
@@ -73,9 +71,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test3()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "+3", "+3", "+4", "-2", "-4", });
string result = day01.ResolvePart2(new[] { "+3", "+3", "+4", "-2", "-4", });
Assert.Equal("10", result);
}
@@ -83,9 +81,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test4()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "-6", "+3", "+8", "+5", "-6", });
string result = day01.ResolvePart2(new[] { "-6", "+3", "+8", "+5", "-6", });
Assert.Equal("5", result);
}
@@ -93,13 +91,12 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test5()
{
Day01 day01 = new Day01();
Day01 day01 = new();
string result = day01.ResolvePart2(new string[] { "+7", "+7", "-2", "-7", "-4", });
string result = day01.ResolvePart2(new[] { "+7", "+7", "-2", "-7", "-4", });
Assert.Equal("14", result);
}
#endregion ResolvePart2
}
}

15
AdventOfCode2018.Tests/Day02_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day02_Tests
{
public class Day02_Tests
{
[Fact]
public void ResolvePart1__Test1()
{
Day02 day02 = new Day02();
Day02 day02 = new();
string result = day02.ResolvePart1(new string[] {
string result = day02.ResolvePart1(new[] {
"abcdef",
"bababc",
"abbcde",
@@ -25,9 +23,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day02 day02 = new Day02();
Day02 day02 = new();
string result = day02.ResolvePart2(new string[] {
string result = day02.ResolvePart2(new[] {
"abcde",
"fghij",
"klmno",
@@ -39,5 +37,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("fgij", result);
}
}
}

15
AdventOfCode2018.Tests/Day03_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day03_Tests
{
public class Day03_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day03 day03 = new Day03();
Day03 day03 = new();
string result = day03.ResolvePart1(new string[] {
string result = day03.ResolvePart1(new[] {
"#1 @ 1,3: 4x4",
"#2 @ 3,1: 4x4",
"#3 @ 5,5: 2x2",
@@ -21,9 +19,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day03 day03 = new Day03();
Day03 day03 = new();
string result = day03.ResolvePart2(new string[] {
string result = day03.ResolvePart2(new[] {
"#1 @ 1,3: 4x4",
"#2 @ 3,1: 4x4",
"#3 @ 5,5: 2x2",
@@ -31,5 +29,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("3", result);
}
}
}

23
AdventOfCode2018.Tests/Day04_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day04_Tests
{
public class Day04_Tests
{
[Fact]
public void ResolvePart1__BaseStatement()
{
Day04 day04 = new Day04();
Day04 day04 = new();
string result = day04.ResolvePart1(new string[] {
string result = day04.ResolvePart1(new[] {
"[1518-11-01 00:00] Guard #10 begins shift",
"[1518-11-01 00:05] falls asleep",
"[1518-11-01 00:25] wakes up",
@@ -35,9 +33,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__BaseStatementUnsorted()
{
Day04 day04 = new Day04();
Day04 day04 = new();
string result = day04.ResolvePart1(new string[] {
string result = day04.ResolvePart1(new[] {
"[1518-11-04 00:36] falls asleep",
"[1518-11-04 00:46] wakes up",
"[1518-11-05 00:03] Guard #99 begins shift",
@@ -64,9 +62,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__BaseStatement()
{
Day04 day04 = new Day04();
Day04 day04 = new();
string result = day04.ResolvePart2(new string[] {
string result = day04.ResolvePart2(new[] {
"[1518-11-01 00:00] Guard #10 begins shift",
"[1518-11-01 00:05] falls asleep",
"[1518-11-01 00:25] wakes up",
@@ -92,9 +90,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__BaseStatementUnsorted()
{
Day04 day04 = new Day04();
Day04 day04 = new();
string result = day04.ResolvePart2(new string[] {
string result = day04.ResolvePart2(new[] {
"[1518-11-04 00:36] falls asleep",
"[1518-11-04 00:46] wakes up",
"[1518-11-05 00:03] Guard #99 begins shift",
@@ -116,5 +114,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("4455", result);
}
}
}

47
AdventOfCode2018.Tests/Day05_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day05_Tests
{
public class Day05_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ResolvePart1(new string[] { "dabAcCaCBAcCcaDA" });
string result = day05.ResolvePart1(new[] { "dabAcCaCBAcCcaDA" });
Assert.Equal("10", result);
}
@@ -17,9 +15,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ResolvePart2(new string[] { "dabAcCaCBAcCcaDA" });
string result = day05.ResolvePart2(new[] { "dabAcCaCBAcCcaDA" });
Assert.Equal("4", result);
}
@@ -29,7 +27,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_cC()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("dabAcCaCBA");
@@ -39,7 +37,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_cC_AtEnd()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("dabAcC");
@@ -49,7 +47,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_Only_cC()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("cC");
@@ -59,7 +57,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_cC_AtStart()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("cCAAAA");
@@ -69,7 +67,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_Aa()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("dabAaCBA");
@@ -79,7 +77,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Remove_cCc()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("dabCBAcCcaDA");
@@ -89,7 +87,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ReducePolymer__Irreductible()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.ReducePolymer("dabCBAcaDA");
@@ -103,7 +101,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void FullyReducePolymer__Test()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.FullyReducePolymer("dabAcCaCBAcCcaDA");
@@ -117,7 +115,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_a()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'a');
@@ -127,7 +125,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_b()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'b');
@@ -137,7 +135,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_c()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'c');
@@ -147,7 +145,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_d()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'd');
@@ -157,7 +155,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_A()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'A');
@@ -167,7 +165,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_B()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'B');
@@ -177,7 +175,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_C()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'C');
@@ -187,7 +185,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void RemoveUnitTypeFromPolymer__Remove_D()
{
Day05 day05 = new Day05();
Day05 day05 = new();
string result = day05.RemoveUnitTypeFromPolymer("dabAcCaCBAcCcaDA", 'D');
@@ -195,5 +193,4 @@ namespace AdventOfCode2018.Tests
}
#endregion RemoveUnitTypeFromPolymer
}
}

16
AdventOfCode2018.Tests/Day06_Tests.cs
View File

@@ -1,16 +1,13 @@
using System.Collections.Generic;
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day06_Tests
{
public class Day06_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day06 day06 = new Day06();
Day06 day06 = new();
string result = day06.ResolvePart1(new string[] {
string result = day06.ResolvePart1(new[] {
"1, 1",
"1, 6",
"8, 3",
@@ -25,9 +22,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day06 day06 = new Day06 { DistanceThresold = 32, };
Day06 day06 = new() { DistanceThresold = 32, };
string result = day06.ResolvePart2(new string[] {
string result = day06.ResolvePart2(new[] {
"1, 1",
"1, 6",
"8, 3",
@@ -38,5 +35,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("16", result);
}
}
}

15
AdventOfCode2018.Tests/Day07_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day07_Tests
{
public class Day07_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day07 day07 = new Day07();
Day07 day07 = new();
string result = day07.ResolvePart1(new string[] {
string result = day07.ResolvePart1(new[] {
"Step C must be finished before step A can begin.",
"Step C must be finished before step F can begin.",
"Step A must be finished before step B can begin.",
@@ -25,9 +23,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day07 day07 = new Day07 { BaseCost = 0, NumberOfWorkers = 2 };
Day07 day07 = new() { BaseCost = 0, NumberOfWorkers = 2 };
string result = day07.ResolvePart2(new string[] {
string result = day07.ResolvePart2(new[] {
"Step C must be finished before step A can begin.",
"Step C must be finished before step F can begin.",
"Step A must be finished before step B can begin.",
@@ -39,5 +37,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("15", result);
}
}
}

15
AdventOfCode2018.Tests/Day08_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day08_Tests
{
public class Day08_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day08 day = new Day08();
Day08 day = new();
string result = day.ResolvePart1(new string[] { "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", });
string result = day.ResolvePart1(new[] { "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", });
Assert.Equal("138", result);
}
@@ -17,11 +15,10 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day08 day = new Day08();
Day08 day = new();
string result = day.ResolvePart2(new string[] { "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", });
string result = day.ResolvePart2(new[] { "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", });
Assert.Equal("66", result);
}
}
}

31
AdventOfCode2018.Tests/Day09_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day09_Tests
{
public class Day09_Tests
{
[Fact]
public void ResolvePart1__Test1()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "9 players; last marble is worth 25 points" });
string result = day.ResolvePart1(new[] { "9 players; last marble is worth 25 points" });
Assert.Equal("32", result);
}
@@ -17,9 +15,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "10 players; last marble is worth 1618 points" });
string result = day.ResolvePart1(new[] { "10 players; last marble is worth 1618 points" });
Assert.Equal("8317", result);
}
@@ -27,9 +25,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test3()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "13 players; last marble is worth 7999 points" });
string result = day.ResolvePart1(new[] { "13 players; last marble is worth 7999 points" });
Assert.Equal("146373", result);
}
@@ -37,9 +35,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test4()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "17 players; last marble is worth 1104 points" });
string result = day.ResolvePart1(new[] { "17 players; last marble is worth 1104 points" });
Assert.Equal("2764", result);
}
@@ -47,9 +45,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test5()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "21 players; last marble is worth 6111 points" });
string result = day.ResolvePart1(new[] { "21 players; last marble is worth 6111 points" });
Assert.Equal("54718", result);
}
@@ -57,11 +55,10 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test6()
{
Day09 day = new Day09();
Day09 day = new();
string result = day.ResolvePart1(new string[] { "30 players; last marble is worth 5807 points" });
string result = day.ResolvePart1(new[] { "30 players; last marble is worth 5807 points" });
Assert.Equal("37305", result);
}
}
}

16
AdventOfCode2018.Tests/Day10_Tests.cs
View File

@@ -1,16 +1,15 @@
using System;
using Xunit;
namespace AdventOfCode2018.Tests
namespace AdventOfCode2018.Tests;
public class Day10_Tests
{
public class Day10_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day10 day = new Day10 { Width = 12, Height = 10 };
Day10 day = new() { Width = 12, Height = 10 };
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"position=< 9, 1> velocity=< 0, 2>",
"position=< 7, 0> velocity=<-1, 0>",
"position=< 3, -2> velocity=<-1, 1>",
@@ -60,9 +59,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day10 day = new Day10();
Day10 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"position=< 9, 1> velocity=< 0, 2>",
"position=< 7, 0> velocity=<-1, 0>",
"position=< 3, -2> velocity=<-1, 1>",
@@ -98,5 +97,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("3", result);
}
}
}

15
AdventOfCode2018.Tests/Day11_Tests.cs
View File

@@ -1,9 +1,7 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day11_Tests
{
public class Day11_Tests
{
[Fact]
public void CalculatePowerLevelOfCell__Test1()
{
@@ -60,17 +58,16 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test1()
{
Day11 day = new Day11();
string result = day.ResolvePart2(new string[] { "18" });
Day11 day = new();
string result = day.ResolvePart2(new[] { "18" });
Assert.Equal("90,269,16", result);
}
[Fact]
public void ResolvePart2__Test2()
{
Day11 day = new Day11();
string result = day.ResolvePart2(new string[] { "42" });
Day11 day = new();
string result = day.ResolvePart2(new[] { "42" });
Assert.Equal("232,251,12", result);
}
}
}

11
AdventOfCode2018.Tests/Day12_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day12_Tests
{
public class Day12_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day12 day = new Day12();
Day12 day = new();
string result = day.ResolvePart1(new string[]
string result = day.ResolvePart1(new[]
{
"initial state: #..#.#..##......###...###",
"",
@@ -31,5 +29,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("325", result);
}
}
}

19
AdventOfCode2018.Tests/Day13_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day13_Tests
{
public class Day13_Tests
{
[Fact]
public void ResolvePart1__Test1()
{
Day13 day = new Day13();
Day13 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"|",
"v",
"|",
@@ -25,9 +23,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day13 day = new Day13();
Day13 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
@"/->-\ ",
@"| | /----\",
@"| /-+--+-\ |",
@@ -42,9 +40,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day13 day = new Day13();
Day13 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
@"/>-<\ ",
@"| | ",
@"| /<+-\",
@@ -56,5 +54,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("6,4", result);
}
}
}

39
AdventOfCode2018.Tests/Day14_Tests.cs
View File

@@ -1,17 +1,15 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day14_Tests
{
public class Day14_Tests
{
#region ResolvePart1
[Fact]
public void ResolvePart1__Test1()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart1(new string[] { "9", });
string result = day.ResolvePart1(new[] { "9", });
Assert.Equal("5158916779", result);
}
@@ -19,9 +17,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart1(new string[] { "5", });
string result = day.ResolvePart1(new[] { "5", });
Assert.Equal("0124515891", result);
}
@@ -29,9 +27,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test3()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart1(new string[] { "18", });
string result = day.ResolvePart1(new[] { "18", });
Assert.Equal("9251071085", result);
}
@@ -39,9 +37,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test4()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart1(new string[] { "2018", });
string result = day.ResolvePart1(new[] { "2018", });
Assert.Equal("5941429882", result);
}
@@ -53,9 +51,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test1()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart2(new string[] { "51589", });
string result = day.ResolvePart2(new[] { "51589", });
Assert.Equal("9", result);
}
@@ -63,9 +61,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test2()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart2(new string[] { "01245", });
string result = day.ResolvePart2(new[] { "01245", });
Assert.Equal("5", result);
}
@@ -73,9 +71,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test3()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart2(new string[] { "92510", });
string result = day.ResolvePart2(new[] { "92510", });
Assert.Equal("18", result);
}
@@ -83,13 +81,12 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test4()
{
Day14 day = new Day14();
Day14 day = new();
string result = day.ResolvePart2(new string[] { "59414", });
string result = day.ResolvePart2(new[] { "59414", });
Assert.Equal("2018", result);
}
#endregion ResolvePart2
}
}

57
AdventOfCode2018.Tests/Day15_Tests.cs
View File

@@ -1,23 +1,15 @@
using Xunit;
using AdventOfCode2018;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day15_Tests
{
public class Day15_Tests
{
#region ResolvePart1
[Fact]
public void ResolvePart1__Test1()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#######",
"#.G...#",
"#...EG#",
@@ -33,9 +25,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test2()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#######",
"#G..#E#",
"#E#E.E#",
@@ -51,9 +43,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test3()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#######",
"#E..EG#",
"#.#G.E#",
@@ -69,9 +61,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test4()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#######",
"#E.G#.#",
"#.#G..#",
@@ -87,9 +79,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test5()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#######",
"#.E...#",
"#.#..G#",
@@ -105,9 +97,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart1__Test6()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"#########",
"#G......#",
"#.E.#...#",
@@ -129,9 +121,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test1()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"#######",
"#.G...#",
"#...EG#",
@@ -147,9 +139,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test3()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"#######",
"#E..EG#",
"#.#G.E#",
@@ -165,9 +157,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test4()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"#######",
"#E.G#.#",
"#.#G..#",
@@ -183,9 +175,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test5()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"#######",
"#.E...#",
"#.#..G#",
@@ -201,9 +193,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test6()
{
Day15 day = new Day15();
Day15 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"#########",
"#G......#",
"#.E.#...#",
@@ -219,5 +211,4 @@ namespace AdventOfCode2018.Tests
}
#endregion ResolvePart2
}
}

16
AdventOfCode2018.Tests/Day23_Tests.cs
View File

@@ -1,16 +1,13 @@
using AdventOfCode2018;
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class Day23_Tests
{
public class Day23_Tests
{
[Fact]
public void ResolvePart1__Test()
{
Day23 day = new Day23();
Day23 day = new();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"pos=<0,0,0>, r=4",
"pos=<1,0,0>, r=1",
"pos=<4,0,0>, r=3",
@@ -28,9 +25,9 @@ namespace AdventOfCode2018.Tests
[Fact]
public void ResolvePart2__Test()
{
Day23 day = new Day23();
Day23 day = new();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"pos=<10,12,12>, r=2",
"pos=<12,14,12>, r=2",
"pos=<16,12,12>, r=4",
@@ -41,5 +38,4 @@ namespace AdventOfCode2018.Tests
Assert.Equal("36", result);
}
}
}

16
AdventOfCode2018.Tests/GuardEvent_Tests.cs
View File

@@ -1,10 +1,9 @@
using System.Collections.Generic;
using Xunit;
namespace AdventOfCode2018.Tests
namespace AdventOfCode2018.Tests;
public class GuardEvent_Tests
{
public class GuardEvent_Tests
{
#region FromString
[Fact]
@@ -25,7 +24,7 @@ namespace AdventOfCode2018.Tests
{
GuardEvent guardEvent = GuardEvent.FromString("[1518-11-02 00:40] falls asleep");
Assert.Equal(null, guardEvent.ID);
Assert.Null(guardEvent.ID);
Assert.Equal(11, guardEvent.Date.Month);
Assert.Equal(2, guardEvent.Date.Day);
Assert.Equal(0, guardEvent.Date.Hour);
@@ -38,7 +37,7 @@ namespace AdventOfCode2018.Tests
{
GuardEvent guardEvent = GuardEvent.FromString("[1518-11-03 00:29] wakes up");
Assert.Equal(null, guardEvent.ID);
Assert.Null(guardEvent.ID);
Assert.Equal(11, guardEvent.Date.Month);
Assert.Equal(3, guardEvent.Date.Day);
Assert.Equal(0, guardEvent.Date.Hour);
@@ -53,7 +52,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void FromStringArray__TestBase()
{
List<GuardEvent> guardEvents = GuardEvent.FromStringArray(new string[] {
List<GuardEvent> guardEvents = GuardEvent.FromStringArray(new[] {
"[1518-11-01 00:00] Guard #10 begins shift",
"[1518-11-01 00:05] falls asleep",
"[1518-11-01 00:25] wakes up",
@@ -92,7 +91,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void FromStringArray__TestBaseUnsorted()
{
List<GuardEvent> guardEvents = GuardEvent.FromStringArray(new string[] {
List<GuardEvent> guardEvents = GuardEvent.FromStringArray(new[] {
"[1518-11-01 00:00] Guard #10 begins shift",
"[1518-11-01 23:58] Guard #99 begins shift",
"[1518-11-01 00:30] falls asleep",
@@ -129,5 +128,4 @@ namespace AdventOfCode2018.Tests
}
#endregion FromStringArray
}
}

19
AdventOfCode2018.Tests/MarbleGame_Tests.cs
View File

@@ -1,13 +1,11 @@
using Xunit;
namespace AdventOfCode2018.Tests;
namespace AdventOfCode2018.Tests
public class MarbleGame_Tests
{
public class MarbleGame_Tests
{
[Fact]
public void PlayGame__Test1()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(9, 25);
long highScore = marbleGame.GetHighScore();
@@ -18,7 +16,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void PlayGame__Test2()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(10, 1618);
long highScore = marbleGame.GetHighScore();
@@ -29,7 +27,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void PlayGame__Test3()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(13, 7999);
long highScore = marbleGame.GetHighScore();
@@ -40,7 +38,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void PlayGame__Test4()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(17, 1104);
long highScore = marbleGame.GetHighScore();
@@ -51,7 +49,7 @@ namespace AdventOfCode2018.Tests
[Fact]
public void PlayGame__Test5()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(21, 6111);
long highScore = marbleGame.GetHighScore();
@@ -62,12 +60,11 @@ namespace AdventOfCode2018.Tests
[Fact]
public void PlayGame__Test6()
{
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(30, 5807);
long highScore = marbleGame.GetHighScore();
Assert.Equal(37305, highScore);
}
}
}

1
AdventOfCode2018.Tests/Usings.cs Normal file
View File

@@ -0,0 +1 @@
global using Xunit;

44
AdventOfCode2018/Day01.cs
View File

@@ -1,42 +1,41 @@
using System.Collections.Generic;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
--- Day 1: Chronal Calibration ---
"We've detected some temporal anomalies," one of Santa's Elves at the Temporal Anomaly Research and Detection Instrument Station tells you. She sounded pretty worried when she called you down here. "At 500-year intervals into the past, someone has been changing Santa's history!"
"We've detected some temporal anomalies," one of Santa's Elves at the Temporal Anomaly Research and Detection Instrument Station tells you. She sounded pretty worried when she called you down here. "At 500-year intervals into the past, someone has been changing Santa's history!"
"The good news is that the changes won't propagate to our time stream for another 25 days, and we have a device" - she attaches something to your wrist - "that will let you fix the changes with no such propagation delay. It's configured to send you 500 years further into the past every few days; that was the best we could do on such short notice."
"The good news is that the changes won't propagate to our time stream for another 25 days, and we have a device" - she attaches something to your wrist - "that will let you fix the changes with no such propagation delay. It's configured to send you 500 years further into the past every few days; that was the best we could do on such short notice."
"The bad news is that we are detecting roughly fifty anomalies throughout time; the device will indicate fixed anomalies with stars. The other bad news is that we only have one device and you're the best person for the job! Good lu--" She taps a button on the device and you suddenly feel like you're falling. To save Christmas, you need to get all fifty stars by December 25th.
"The bad news is that we are detecting roughly fifty anomalies throughout time; the device will indicate fixed anomalies with stars. The other bad news is that we only have one device and you're the best person for the job! Good lu--" She taps a button on the device and you suddenly feel like you're falling. To save Christmas, you need to get all fifty stars by 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!
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!
After feeling like you've been falling for a few minutes, you look at the device's tiny screen. "Error: Device must be calibrated before first use. Frequency drift detected. Cannot maintain destination lock." Below the message, the device shows a sequence of changes in frequency (your puzzle input). A value like +6 means the current frequency increases by 6; a value like -3 means the current frequency decreases by 3.
After feeling like you've been falling for a few minutes, you look at the device's tiny screen. "Error: Device must be calibrated before first use. Frequency drift detected. Cannot maintain destination lock." Below the message, the device shows a sequence of changes in frequency (your puzzle input). A value like +6 means the current frequency increases by 6; a value like -3 means the current frequency decreases by 3.
For example, if the device displays frequency changes of +1, -2, +3, +1, then starting from a frequency of zero, the following changes would occur:
For example, if the device displays frequency changes of +1, -2, +3, +1, then starting from a frequency of zero, the following changes would occur:
Current frequency 0, change of +1; resulting frequency 1.
Current frequency 1, change of -2; resulting frequency -1.
Current frequency -1, change of +3; resulting frequency 2.
Current frequency 2, change of +1; resulting frequency 3.
In this example, the resulting frequency is 3.
In this example, the resulting frequency is 3.
Here are other example situations:
Here are other example situations:
+1, +1, +1 results in 3
+1, +1, -2 results in 0
-1, -2, -3 results in -6
Starting with a frequency of zero, what is the resulting frequency after all of the changes in frequency have been applied?
Starting with a frequency of zero, what is the resulting frequency after all of the changes in frequency have been applied?
--- Part Two ---
--- Part Two ---
You notice that the device repeats the same frequency change list over and over. To calibrate the device, you need to find the first frequency it reaches twice.
You notice that the device repeats the same frequency change list over and over. To calibrate the device, you need to find the first frequency it reaches twice.
For example, using the same list of changes above, the device would loop as follows:
For example, using the same list of changes above, the device would loop as follows:
Current frequency 0, change of +1; resulting frequency 1.
Current frequency 1, change of -2; resulting frequency -1.
@@ -46,21 +45,21 @@ namespace AdventOfCode2018
Current frequency 3, change of +1; resulting frequency 4.
Current frequency 4, change of -2; resulting frequency 2, which has already been seen.
In this example, the first frequency reached twice is 2. Note that your device might need to repeat its list of frequency changes many times before a duplicate frequency is found, and that duplicates might be found while in the middle of processing the list.
In this example, the first frequency reached twice is 2. Note that your device might need to repeat its list of frequency changes many times before a duplicate frequency is found, and that duplicates might be found while in the middle of processing the list.
Here are other examples:
Here are other examples:
+1, -1 first reaches 0 twice.
+3, +3, +4, -2, -4 first reaches 10 twice.
-6, +3, +8, +5, -6 first reaches 5 twice.
+7, +7, -2, -7, -4 first reaches 14 twice.
What is the first frequency your device reaches twice?
What is the first frequency your device reaches twice?
*/
*/
public class Day01 : IDay
{
public class Day01 : IDay
{
public string ResolvePart1(string[] inputs)
{
int accumulator = 0;
@@ -86,7 +85,7 @@ namespace AdventOfCode2018
public string ResolvePart2(string[] inputs)
{
int accumulator = 0;
List<int> accumulatorHistory = new List<int>();
List<int> accumulatorHistory = new();
int? repeatedAccumulator = null;
while (repeatedAccumulator == null)
{
@@ -115,5 +114,4 @@ namespace AdventOfCode2018
}
return repeatedAccumulator.ToString();
}
}
}

56
AdventOfCode2018/Day02.cs
View File

@@ -2,22 +2,21 @@
using System.Linq;
using System.Text;
namespace AdventOfCode2018
{
/*
--- Day 2: Inventory Management System ---
namespace AdventOfCode2018;
/*
--- Day 2: Inventory Management System ---
You stop falling through time, catch your breath, and check the screen on the device. "Destination reached. Current Year: 1518. Current Location: North Pole Utility Closet 83N10." You made it! Now, to find those anomalies.
You stop falling through time, catch your breath, and check the screen on the device. "Destination reached. Current Year: 1518. Current Location: North Pole Utility Closet 83N10." You made it! Now, to find those anomalies.
Outside the utility closet, you hear footsteps and a voice. "...I'm not sure either. But now that so many people have chimneys, maybe he could sneak in that way?" Another voice responds, "Actually, we've been working on a new kind of suit that would let him fit through tight spaces like that. But, I heard that a few days ago, they lost the prototype fabric, the design plans, everything! Nobody on the team can even seem to remember important details of the project!"
Outside the utility closet, you hear footsteps and a voice. "...I'm not sure either. But now that so many people have chimneys, maybe he could sneak in that way?" Another voice responds, "Actually, we've been working on a new kind of suit that would let him fit through tight spaces like that. But, I heard that a few days ago, they lost the prototype fabric, the design plans, everything! Nobody on the team can even seem to remember important details of the project!"
"Wouldn't they have had enough fabric to fill several boxes in the warehouse? They'd be stored together, so the box IDs should be similar. Too bad it would take forever to search the warehouse for two similar box IDs..." They walk too far away to hear any more.
"Wouldn't they have had enough fabric to fill several boxes in the warehouse? They'd be stored together, so the box IDs should be similar. Too bad it would take forever to search the warehouse for two similar box IDs..." They walk too far away to hear any more.
Late at night, you sneak to the warehouse - who knows what kinds of paradoxes you could cause if you were discovered - and use your fancy wrist device to quickly scan every box and produce a list of the likely candidates (your puzzle input).
Late at night, you sneak to the warehouse - who knows what kinds of paradoxes you could cause if you were discovered - and use your fancy wrist device to quickly scan every box and produce a list of the likely candidates (your puzzle input).
To make sure you didn't miss any, you scan the likely candidate boxes again, counting the number that have an ID containing exactly two of any letter and then separately counting those with exactly three of any letter. You can multiply those two counts together to get a rudimentary checksum and compare it to what your device predicts.
To make sure you didn't miss any, you scan the likely candidate boxes again, counting the number that have an ID containing exactly two of any letter and then separately counting those with exactly three of any letter. You can multiply those two counts together to get a rudimentary checksum and compare it to what your device predicts.
For example, if you see the following box IDs:
For example, if you see the following box IDs:
abcdef contains no letters that appear exactly two or three times.
bababc contains two a and three b, so it counts for both.
@@ -27,32 +26,32 @@ namespace AdventOfCode2018
abcdee contains two e.
ababab contains three a and three b, but it only counts once.
Of these box IDs, four of them contain a letter which appears exactly twice, and three of them contain a letter which appears exactly three times. Multiplying these together produces a checksum of 4 * 3 = 12.
Of these box IDs, four of them contain a letter which appears exactly twice, and three of them contain a letter which appears exactly three times. Multiplying these together produces a checksum of 4 * 3 = 12.
What is the checksum for your list of box IDs?
What is the checksum for your list of box IDs?
--- Part Two ---
--- Part Two ---
Confident that your list of box IDs is complete, you're ready to find the boxes full of prototype fabric.
Confident that your list of box IDs is complete, you're ready to find the boxes full of prototype fabric.
The boxes will have IDs which differ by exactly one character at the same position in both strings. For example, given the following box IDs:
The boxes will have IDs which differ by exactly one character at the same position in both strings. For example, given the following box IDs:
abcde
fghij
klmno
pqrst
fguij
axcye
wvxyz
abcde
fghij
klmno
pqrst
fguij
axcye
wvxyz
The IDs abcde and axcye are close, but they differ by two characters (the second and fourth). However, the IDs fghij and fguij differ by exactly one character, the third (h and u). Those must be the correct boxes.
The IDs abcde and axcye are close, but they differ by two characters (the second and fourth). However, the IDs fghij and fguij differ by exactly one character, the third (h and u). Those must be the correct boxes.
What letters are common between the two correct box IDs? (In the example above, this is found by removing the differing character from either ID, producing fgij.)
What letters are common between the two correct box IDs? (In the example above, this is found by removing the differing character from either ID, producing fgij.)
*/
*/
public class Day02 : IDay
{
public class Day02 : IDay
{
private int CountOccurrencesOfLetter(string text, char letter)
{
return text.Count(c => (c == letter));
@@ -92,7 +91,7 @@ namespace AdventOfCode2018
{
if (id1.Length != id2.Length) { throw new ArgumentException("id1 and id2 parameters must be of same length"); }
int diffCount = 0;
StringBuilder sb = new StringBuilder();
StringBuilder sb = new();
for (int i = 0; i < id1.Length; i++)
{
if (id1[i] != id2[i]) { diffCount++; }
@@ -114,5 +113,4 @@ namespace AdventOfCode2018
return string.Empty;
}
}
}

84
AdventOfCode2018/Day03.cs
View File

@@ -2,67 +2,66 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
--- Day 3: No Matter How You Slice It ---
namespace AdventOfCode2018;
/*
--- Day 3: No Matter How You Slice It ---
The Elves managed to locate the chimney-squeeze prototype fabric for Santa's suit (thanks to someone who helpfully wrote its box IDs on the wall of the warehouse in the middle of the night). Unfortunately, anomalies are still affecting them - nobody can even agree on how to cut the fabric.
The Elves managed to locate the chimney-squeeze prototype fabric for Santa's suit (thanks to someone who helpfully wrote its box IDs on the wall of the warehouse in the middle of the night). Unfortunately, anomalies are still affecting them - nobody can even agree on how to cut the fabric.
The whole piece of fabric they're working on is a very large square - at least 1000 inches on each side.
The whole piece of fabric they're working on is a very large square - at least 1000 inches on each side.
Each Elf has made a claim about which area of fabric would be ideal for Santa's suit. All claims have an ID and consist of a single rectangle with edges parallel to the edges of the fabric. Each claim's rectangle is defined as follows:
Each Elf has made a claim about which area of fabric would be ideal for Santa's suit. All claims have an ID and consist of a single rectangle with edges parallel to the edges of the fabric. Each claim's rectangle is defined as follows:
The number of inches between the left edge of the fabric and the left edge of the rectangle.
The number of inches between the top edge of the fabric and the top edge of the rectangle.
The width of the rectangle in inches.
The height of the rectangle in inches.
A claim like #123 @ 3,2: 5x4 means that claim ID 123 specifies a rectangle 3 inches from the left edge, 2 inches from the top edge, 5 inches wide, and 4 inches tall. Visually, it claims the square inches of fabric represented by # (and ignores the square inches of fabric represented by .) in the diagram below:
A claim like #123 @ 3,2: 5x4 means that claim ID 123 specifies a rectangle 3 inches from the left edge, 2 inches from the top edge, 5 inches wide, and 4 inches tall. Visually, it claims the square inches of fabric represented by # (and ignores the square inches of fabric represented by .) in the diagram below:
...........
...........
...#####...
...#####...
...#####...
...#####...
...........
...........
...........
...........
...........
...#####...
...#####...
...#####...
...#####...
...........
...........
...........
The problem is that many of the claims overlap, causing two or more claims to cover part of the same areas. For example, consider the following claims:
The problem is that many of the claims overlap, causing two or more claims to cover part of the same areas. For example, consider the following claims:
#1 @ 1,3: 4x4
#2 @ 3,1: 4x4
#3 @ 5,5: 2x2
#1 @ 1,3: 4x4
#2 @ 3,1: 4x4
#3 @ 5,5: 2x2
Visually, these claim the following areas:
Visually, these claim the following areas:
........
...2222.
...2222.
.11XX22.
.11XX22.
.111133.
.111133.
........
........
...2222.
...2222.
.11XX22.
.11XX22.
.111133.
.111133.
........
The four square inches marked with X are claimed by both 1 and 2. (Claim 3, while adjacent to the others, does not overlap either of them.)
The four square inches marked with X are claimed by both 1 and 2. (Claim 3, while adjacent to the others, does not overlap either of them.)
If the Elves all proceed with their own plans, none of them will have enough fabric. How many square inches of fabric are within two or more claims?
If the Elves all proceed with their own plans, none of them will have enough fabric. How many square inches of fabric are within two or more claims?
--- Part Two ---
--- Part Two ---
Amidst the chaos, you notice that exactly one claim doesn't overlap by even a single square inch of fabric with any other claim. If you can somehow draw attention to it, maybe the Elves will be able to make Santa's suit after all!
Amidst the chaos, you notice that exactly one claim doesn't overlap by even a single square inch of fabric with any other claim. If you can somehow draw attention to it, maybe the Elves will be able to make Santa's suit after all!
For example, in the claims above, only claim 3 is intact after all claims are made.
For example, in the claims above, only claim 3 is intact after all claims are made.
What is the ID of the only claim that doesn't overlap?
What is the ID of the only claim that doesn't overlap?
*/
*/
public class Day03 : IDay
{
public class Day03 : IDay
{
public string ResolvePart1(string[] inputs)
{
List<Claim> claims = inputs.Select(i => Claim.FromString(i)).ToList();
@@ -145,8 +144,8 @@ namespace AdventOfCode2018
public static Claim FromString(string strClaim)
{
Claim claim = new Claim();
string[] parts = strClaim.Split(new string[] { " @ ", ",", ": ", "x", }, StringSplitOptions.None);
Claim claim = new();
string[] parts = strClaim.Split(new[] { " @ ", ",", ": ", "x", }, StringSplitOptions.None);
claim.ID = Convert.ToInt32(parts[0].Substring(1));
claim.Left = Convert.ToInt32(parts[1]);
claim.Top = Convert.ToInt32(parts[2]);
@@ -175,7 +174,4 @@ namespace AdventOfCode2018
return false;
}
}
}
}

123
AdventOfCode2018/Day04.cs
View File

@@ -2,73 +2,73 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
--- Day 4: Repose Record ---
namespace AdventOfCode2018;
You've sneaked into another supply closet - this time, it's across from the prototype suit manufacturing lab. You need to sneak inside and fix the issues with the suit, but there's a guard stationed outside the lab, so this is as close as you can safely get.
/*
--- Day 4: Repose Record ---
As you search the closet for anything that might help, you discover that you're not the first person to want to sneak in. Covering the walls, someone has spent an hour starting every midnight for the past few months secretly observing this guard post! They've been writing down the ID of the one guard on duty that night - the Elves seem to have decided that one guard was enough for the overnight shift - as well as when they fall asleep or wake up while at their post (your puzzle input).
You've sneaked into another supply closet - this time, it's across from the prototype suit manufacturing lab. You need to sneak inside and fix the issues with the suit, but there's a guard stationed outside the lab, so this is as close as you can safely get.
For example, consider the following records, which have already been organized into chronological order:
As you search the closet for anything that might help, you discover that you're not the first person to want to sneak in. Covering the walls, someone has spent an hour starting every midnight for the past few months secretly observing this guard post! They've been writing down the ID of the one guard on duty that night - the Elves seem to have decided that one guard was enough for the overnight shift - as well as when they fall asleep or wake up while at their post (your puzzle input).
[1518-11-01 00:00] Guard #10 begins shift
[1518-11-01 00:05] falls asleep
[1518-11-01 00:25] wakes up
[1518-11-01 00:30] falls asleep
[1518-11-01 00:55] wakes up
[1518-11-01 23:58] Guard #99 begins shift
[1518-11-02 00:40] falls asleep
[1518-11-02 00:50] wakes up
[1518-11-03 00:05] Guard #10 begins shift
[1518-11-03 00:24] falls asleep
[1518-11-03 00:29] wakes up
[1518-11-04 00:02] Guard #99 begins shift
[1518-11-04 00:36] falls asleep
[1518-11-04 00:46] wakes up
[1518-11-05 00:03] Guard #99 begins shift
[1518-11-05 00:45] falls asleep
[1518-11-05 00:55] wakes up
For example, consider the following records, which have already been organized into chronological order:
Timestamps are written using year-month-day hour:minute format. The guard falling asleep or waking up is always the one whose shift most recently started. Because all asleep/awake times are during the midnight hour (00:00 - 00:59), only the minute portion (00 - 59) is relevant for those events.
[1518-11-01 00:00] Guard #10 begins shift
[1518-11-01 00:05] falls asleep
[1518-11-01 00:25] wakes up
[1518-11-01 00:30] falls asleep
[1518-11-01 00:55] wakes up
[1518-11-01 23:58] Guard #99 begins shift
[1518-11-02 00:40] falls asleep
[1518-11-02 00:50] wakes up
[1518-11-03 00:05] Guard #10 begins shift
[1518-11-03 00:24] falls asleep
[1518-11-03 00:29] wakes up
[1518-11-04 00:02] Guard #99 begins shift
[1518-11-04 00:36] falls asleep
[1518-11-04 00:46] wakes up
[1518-11-05 00:03] Guard #99 begins shift
[1518-11-05 00:45] falls asleep
[1518-11-05 00:55] wakes up
Visually, these records show that the guards are asleep at these times:
Timestamps are written using year-month-day hour:minute format. The guard falling asleep or waking up is always the one whose shift most recently started. Because all asleep/awake times are during the midnight hour (00:00 - 00:59), only the minute portion (00 - 59) is relevant for those events.
Date ID Minute
Visually, these records show that the guards are asleep at these times:
Date ID Minute
000000000011111111112222222222333333333344444444445555555555
012345678901234567890123456789012345678901234567890123456789
11-01 #10 .....####################.....#########################.....
11-02 #99 ........................................##########..........
11-03 #10 ........................#####...............................
11-04 #99 ....................................##########..............
11-05 #99 .............................................##########.....
11-01 #10 .....####################.....#########################.....
11-02 #99 ........................................##########..........
11-03 #10 ........................#####...............................
11-04 #99 ....................................##########..............
11-05 #99 .............................................##########.....
The columns are Date, which shows the month-day portion of the relevant day; ID, which shows the guard on duty that day; and Minute, which shows the minutes during which the guard was asleep within the midnight hour. (The Minute column's header shows the minute's ten's digit in the first row and the one's digit in the second row.) Awake is shown as ., and asleep is shown as #.
The columns are Date, which shows the month-day portion of the relevant day; ID, which shows the guard on duty that day; and Minute, which shows the minutes during which the guard was asleep within the midnight hour. (The Minute column's header shows the minute's ten's digit in the first row and the one's digit in the second row.) Awake is shown as ., and asleep is shown as #.
Note that guards count as asleep on the minute they fall asleep, and they count as awake on the minute they wake up. For example, because Guard #10 wakes up at 00:25 on 1518-11-01, minute 25 is marked as awake.
Note that guards count as asleep on the minute they fall asleep, and they count as awake on the minute they wake up. For example, because Guard #10 wakes up at 00:25 on 1518-11-01, minute 25 is marked as awake.
If you can figure out the guard most likely to be asleep at a specific time, you might be able to trick that guard into working tonight so you can have the best chance of sneaking in. You have two strategies for choosing the best guard/minute combination.
If you can figure out the guard most likely to be asleep at a specific time, you might be able to trick that guard into working tonight so you can have the best chance of sneaking in. You have two strategies for choosing the best guard/minute combination.
Strategy 1: Find the guard that has the most minutes asleep. What minute does that guard spend asleep the most?
Strategy 1: Find the guard that has the most minutes asleep. What minute does that guard spend asleep the most?
In the example above, Guard #10 spent the most minutes asleep, a total of 50 minutes (20+25+5), while Guard #99 only slept for a total of 30 minutes (10+10+10). Guard #10 was asleep most during minute 24 (on two days, whereas any other minute the guard was asleep was only seen on one day).
In the example above, Guard #10 spent the most minutes asleep, a total of 50 minutes (20+25+5), while Guard #99 only slept for a total of 30 minutes (10+10+10). Guard #10 was asleep most during minute 24 (on two days, whereas any other minute the guard was asleep was only seen on one day).
While this example listed the entries in chronological order, your entries are in the order you found them. You'll need to organize them before they can be analyzed.
While this example listed the entries in chronological order, your entries are in the order you found them. You'll need to organize them before they can be analyzed.
What is the ID of the guard you chose multiplied by the minute you chose? (In the above example, the answer would be 10 * 24 = 240.)
What is the ID of the guard you chose multiplied by the minute you chose? (In the above example, the answer would be 10 * 24 = 240.)
--- Part Two ---
--- Part Two ---
Strategy 2: Of all guards, which guard is most frequently asleep on the same minute?
Strategy 2: Of all guards, which guard is most frequently asleep on the same minute?
In the example above, Guard #99 spent minute 45 asleep more than any other guard or minute - three times in total. (In all other cases, any guard spent any minute asleep at most twice.)
In the example above, Guard #99 spent minute 45 asleep more than any other guard or minute - three times in total. (In all other cases, any guard spent any minute asleep at most twice.)
What is the ID of the guard you chose multiplied by the minute you chose? (In the above example, the answer would be 99 * 45 = 4455.)
What is the ID of the guard you chose multiplied by the minute you chose? (In the above example, the answer would be 99 * 45 = 4455.)
*/
public class Day04 : IDay
{
*/
public class Day04 : IDay
{
public string ResolvePart1(string[] inputs)
{
List<GuardEvent> guardEvents = GuardEvent.FromStringArray(inputs);
@@ -131,14 +131,14 @@ namespace AdventOfCode2018
private static Dictionary<int, GuardSleepHistogram> BuildFullHistorgram(List<GuardEvent> guardEvents)
{
Dictionary<int, GuardSleepHistogram> dictFullHistogram = new Dictionary<int, GuardSleepHistogram>();
Dictionary<int, GuardSleepHistogram> dictFullHistogram = new();
foreach (IGrouping<int, GuardEvent> group in guardEvents.GroupBy(guardEvent => guardEvent.Date.DayOfYear))
{
Dictionary<int, GuardSleepHistogram> dictDayHistogram = new Dictionary<int, GuardSleepHistogram>();
Dictionary<int, GuardSleepHistogram> dictDayHistogram = new();
foreach (GuardEvent guardEvent in group)
{
if (guardEvent.ID == null) { continue; }
GuardSleepHistogram dayGuardHistogram = null;
GuardSleepHistogram dayGuardHistogram;
if (dictDayHistogram.ContainsKey((int)guardEvent.ID))
{
dayGuardHistogram = dictDayHistogram[(int)guardEvent.ID];
@@ -160,7 +160,7 @@ namespace AdventOfCode2018
foreach (GuardSleepHistogram dayGuardHistogram in dictDayHistogram.Values)
{
GuardSleepHistogram guardHistogram = null;
GuardSleepHistogram guardHistogram;
if (dictFullHistogram.ContainsKey(dayGuardHistogram.ID))
{
guardHistogram = dictFullHistogram[dayGuardHistogram.ID];
@@ -175,25 +175,25 @@ namespace AdventOfCode2018
return dictFullHistogram;
}
}
}
public enum GuardEventType
{
public enum GuardEventType
{
ShiftBegin,
FallSleep,
WakeUp,
}
}
public class GuardEvent
{
public class GuardEvent
{
public DateTime Date { get; set; }
public int? ID { get; set; }
public GuardEventType Type { get; set; }
public static GuardEvent FromString(string strEvent)
{
GuardEvent guardEvent = new GuardEvent();
string[] parts = strEvent.Split(new string[] { "[", "-", " ", ":", "]", "#", }, StringSplitOptions.RemoveEmptyEntries);
GuardEvent guardEvent = new();
string[] parts = strEvent.Split(new[] { "[", "-", " ", ":", "]", "#", }, StringSplitOptions.RemoveEmptyEntries);
guardEvent.Date = new DateTime(
Convert.ToInt32(parts[0]),
Convert.ToInt32(parts[1]),
@@ -240,10 +240,10 @@ namespace AdventOfCode2018
return guardEvents;
}
}
}
public class GuardSleepHistogram
{
public class GuardSleepHistogram
{
public const int MinutesOnHour = 60;
public int ID { get; set; }
public int[] SleepOnMunute { get; } = new int[MinutesOnHour];
@@ -271,5 +271,4 @@ namespace AdventOfCode2018
SleepOnMunute[i] += histogram.SleepOnMunute[i];
}
}
}
}

54
AdventOfCode2018/Day05.cs
View File

@@ -2,60 +2,59 @@
using System.Linq;
using System.Text;
namespace AdventOfCode2018
{
/*
--- Day 5: Alchemical Reduction ---
namespace AdventOfCode2018;
/*
--- Day 5: Alchemical Reduction ---
You've managed to sneak in to the prototype suit manufacturing lab. The Elves are making decent progress, but are still struggling with the suit's size reduction capabilities.
You've managed to sneak in to the prototype suit manufacturing lab. The Elves are making decent progress, but are still struggling with the suit's size reduction capabilities.
While the very latest in 1518 alchemical technology might have solved their problem eventually, you can do better. You scan the chemical composition of the suit's material and discover that it is formed by extremely long polymers (one of which is available as your puzzle input).
While the very latest in 1518 alchemical technology might have solved their problem eventually, you can do better. You scan the chemical composition of the suit's material and discover that it is formed by extremely long polymers (one of which is available as your puzzle input).
The polymer is formed by smaller units which, when triggered, react with each other such that two adjacent units of the same type and opposite polarity are destroyed. Units' types are represented by letters; units' polarity is represented by capitalization. For instance, r and R are units with the same type but opposite polarity, whereas r and s are entirely different types and do not react.
The polymer is formed by smaller units which, when triggered, react with each other such that two adjacent units of the same type and opposite polarity are destroyed. Units' types are represented by letters; units' polarity is represented by capitalization. For instance, r and R are units with the same type but opposite polarity, whereas r and s are entirely different types and do not react.
For example:
For example:
In aA, a and A react, leaving nothing behind.
In abBA, bB destroys itself, leaving aA. As above, this then destroys itself, leaving nothing.
In abAB, no two adjacent units are of the same type, and so nothing happens.
In aabAAB, even though aa and AA are of the same type, their polarities match, and so nothing happens.
Now, consider a larger example, dabAcCaCBAcCcaDA:
Now, consider a larger example, dabAcCaCBAcCcaDA:
dabAcCaCBAcCcaDA The first 'cC' is removed.
dabAaCBAcCcaDA This creates 'Aa', which is removed.
dabCBAcCcaDA Either 'cC' or 'Cc' are removed (the result is the same).
dabCBAcaDA No further actions can be taken.
dabAcCaCBAcCcaDA The first 'cC' is removed.
dabAaCBAcCcaDA This creates 'Aa', which is removed.
dabCBAcCcaDA Either 'cC' or 'Cc' are removed (the result is the same).
dabCBAcaDA No further actions can be taken.
After all possible reactions, the resulting polymer contains 10 units.
After all possible reactions, the resulting polymer contains 10 units.
How many units remain after fully reacting the polymer you scanned? (Note: in this puzzle and others, the input is large; if you copy/paste your input, make sure you get the whole thing.)
How many units remain after fully reacting the polymer you scanned? (Note: in this puzzle and others, the input is large; if you copy/paste your input, make sure you get the whole thing.)
--- Part Two ---
--- Part Two ---
Time to improve the polymer.
Time to improve the polymer.
One of the unit types is causing problems; it's preventing the polymer from collapsing as much as it should. Your goal is to figure out which unit type is causing the most problems, remove all instances of it (regardless of polarity), fully react the remaining polymer, and measure its length.
One of the unit types is causing problems; it's preventing the polymer from collapsing as much as it should. Your goal is to figure out which unit type is causing the most problems, remove all instances of it (regardless of polarity), fully react the remaining polymer, and measure its length.
For example, again using the polymer dabAcCaCBAcCcaDA from above:
For example, again using the polymer dabAcCaCBAcCcaDA from above:
Removing all A/a units produces dbcCCBcCcD. Fully reacting this polymer produces dbCBcD, which has length 6.
Removing all B/b units produces daAcCaCAcCcaDA. Fully reacting this polymer produces daCAcaDA, which has length 8.
Removing all C/c units produces dabAaBAaDA. Fully reacting this polymer produces daDA, which has length 4.
Removing all D/d units produces abAcCaCBAcCcaA. Fully reacting this polymer produces abCBAc, which has length 6.
In this example, removing all C/c units was best, producing the answer 4.
In this example, removing all C/c units was best, producing the answer 4.
What is the length of the shortest polymer you can produce by removing all units of exactly one type and fully reacting the result?
What is the length of the shortest polymer you can produce by removing all units of exactly one type and fully reacting the result?
*/
*/
public class Day05 : IDay
{
public class Day05 : IDay
{
public string ReducePolymer(string polymer)
{
if (polymer.Length <= 1) { return polymer; }
StringBuilder sb = new StringBuilder();
StringBuilder sb = new();
int i;
for (i = 1; i < polymer.Length; i++)
@@ -78,7 +77,7 @@ namespace AdventOfCode2018
public string FullyReducePolymer(string input)
{
string previousPolymer = null;
string previousPolymer;
string polymer = input;
do
{
@@ -96,7 +95,7 @@ namespace AdventOfCode2018
public string RemoveUnitTypeFromPolymer(string polymer, char unitType)
{
StringBuilder sb = new StringBuilder();
StringBuilder sb = new();
unitType = char.ToLower(unitType);
foreach (char c in polymer)
{
@@ -127,5 +126,4 @@ namespace AdventOfCode2018
return minPolymerLenght.ToString();
}
}
}

141
AdventOfCode2018/Day06.cs
View File

@@ -2,80 +2,79 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
--- Day 6: Chronal Coordinates ---
namespace AdventOfCode2018;
/*
--- Day 6: Chronal Coordinates ---
The device on your wrist beeps several times, and once again you feel like you're falling.
The device on your wrist beeps several times, and once again you feel like you're falling.
"Situation critical," the device announces. "Destination indeterminate. Chronal interference detected. Please specify new target coordinates."
"Situation critical," the device announces. "Destination indeterminate. Chronal interference detected. Please specify new target coordinates."
The device then produces a list of coordinates (your puzzle input). Are they places it thinks are safe or dangerous? It recommends you check manual page 729. The Elves did not give you a manual.
The device then produces a list of coordinates (your puzzle input). Are they places it thinks are safe or dangerous? It recommends you check manual page 729. The Elves did not give you a manual.
If they're dangerous, maybe you can minimize the danger by finding the coordinate that gives the largest distance from the other points.
If they're dangerous, maybe you can minimize the danger by finding the coordinate that gives the largest distance from the other points.
Using only the Manhattan distance, determine the area around each coordinate by counting the number of integer X,Y locations that are closest to that coordinate (and aren't tied in distance to any other coordinate).
Using only the Manhattan distance, determine the area around each coordinate by counting the number of integer X,Y locations that are closest to that coordinate (and aren't tied in distance to any other coordinate).
Your goal is to find the size of the largest area that isn't infinite. For example, consider the following list of coordinates:
Your goal is to find the size of the largest area that isn't infinite. For example, consider the following list of coordinates:
1, 1
1, 6
8, 3
3, 4
5, 5
8, 9
1, 1
1, 6
8, 3
3, 4
5, 5
8, 9
If we name these coordinates A through F, we can draw them on a grid, putting 0,0 at the top left:
If we name these coordinates A through F, we can draw them on a grid, putting 0,0 at the top left:
..........
.A........
..........
........C.
...D......
.....E....
.B........
..........
..........
........F.
..........
.A........
..........
........C.
...D......
.....E....
.B........
..........
..........
........F.
This view is partial - the actual grid extends infinitely in all directions. Using the Manhattan distance, each location's closest coordinate can be determined, shown here in lowercase:
This view is partial - the actual grid extends infinitely in all directions. Using the Manhattan distance, each location's closest coordinate can be determined, shown here in lowercase:
aaaaa.cccc
aAaaa.cccc
aaaddecccc
aadddeccCc
..dDdeeccc
bb.deEeecc
bBb.eeee..
bbb.eeefff
bbb.eeffff
bbb.ffffFf
aaaaa.cccc
aAaaa.cccc
aaaddecccc
aadddeccCc
..dDdeeccc
bb.deEeecc
bBb.eeee..
bbb.eeefff
bbb.eeffff
bbb.ffffFf
Locations shown as . are equally far from two or more coordinates, and so they don't count as being closest to any.
Locations shown as . are equally far from two or more coordinates, and so they don't count as being closest to any.
In this example, the areas of coordinates A, B, C, and F are infinite - while not shown here, their areas extend forever outside the visible grid. However, the areas of coordinates D and E are finite: D is closest to 9 locations, and E is closest to 17 (both including the coordinate's location itself). Therefore, in this example, the size of the largest area is 17.
In this example, the areas of coordinates A, B, C, and F are infinite - while not shown here, their areas extend forever outside the visible grid. However, the areas of coordinates D and E are finite: D is closest to 9 locations, and E is closest to 17 (both including the coordinate's location itself). Therefore, in this example, the size of the largest area is 17.
What is the size of the largest area that isn't infinite?
What is the size of the largest area that isn't infinite?
--- Part Two ---
--- Part Two ---
On the other hand, if the coordinates are safe, maybe the best you can do is try to find a region near as many coordinates as possible.
On the other hand, if the coordinates are safe, maybe the best you can do is try to find a region near as many coordinates as possible.
For example, suppose you want the sum of the Manhattan distance to all of the coordinates to be less than 32. For each location, add up the distances to all of the given coordinates; if the total of those distances is less than 32, that location is within the desired region. Using the same coordinates as above, the resulting region looks like this:
For example, suppose you want the sum of the Manhattan distance to all of the coordinates to be less than 32. For each location, add up the distances to all of the given coordinates; if the total of those distances is less than 32, that location is within the desired region. Using the same coordinates as above, the resulting region looks like this:
..........
.A........
..........
...###..C.
..#D###...
..###E#...
.B.###....
..........
..........
........F.
..........
.A........
..........
...###..C.
..#D###...
..###E#...
.B.###....
..........
..........
........F.
In particular, consider the highlighted location 4,3 located at the top middle of the region. Its calculation is as follows, where abs() is the absolute value function:
In particular, consider the highlighted location 4,3 located at the top middle of the region. Its calculation is as follows, where abs() is the absolute value function:
Distance to coordinate A: abs(4-1) + abs(3-1) = 5
Distance to coordinate B: abs(4-1) + abs(3-6) = 6
@@ -85,18 +84,18 @@ namespace AdventOfCode2018
Distance to coordinate F: abs(4-8) + abs(3-9) = 10
Total distance: 5 + 6 + 4 + 2 + 3 + 10 = 30
Because the total distance to all coordinates (30) is less than 32, the location is within the region.
Because the total distance to all coordinates (30) is less than 32, the location is within the region.
This region, which also includes coordinates D and E, has a total size of 16.
This region, which also includes coordinates D and E, has a total size of 16.
Your actual region will need to be much larger than this example, though, instead including all locations with a total distance of less than 10000.
Your actual region will need to be much larger than this example, though, instead including all locations with a total distance of less than 10000.
What is the size of the region containing all locations which have a total distance to all given coordinates of less than 10000?
What is the size of the region containing all locations which have a total distance to all given coordinates of less than 10000?
*/
*/
public class Day06 : IDay
{
public class Day06 : IDay
{
private List<ChronoPoint> InputsToPoints(string[] inputs)
{
return inputs
@@ -108,7 +107,7 @@ namespace AdventOfCode2018
public string ResolvePart1(string[] inputs)
{
List<ChronoPoint> points = InputsToPoints(inputs);
Dictionary<int, int> pointsAreas = new Dictionary<int, int>();
Dictionary<int, int> pointsAreas = new();
for (int i = 0; i < points.Count; i++)
{
pointsAreas.Add(i, 0);
@@ -119,7 +118,7 @@ namespace AdventOfCode2018
int minY = points.Min(p => p.Y) - 1;
int maxY = points.Max(p => p.Y) + 1;
ChronoPoint samplingPoint = new ChronoPoint();
ChronoPoint samplingPoint = new();
for(int i=minX; i <= maxX; i++)
{
for(int j = minY; j <= maxY; j++)
@@ -172,7 +171,7 @@ namespace AdventOfCode2018
int maxY = points.Max(p => p.Y) + 1;
int areaInRange = 0;
ChronoPoint samplingPoint = new ChronoPoint();
ChronoPoint samplingPoint = new();
for (int i = minX; i <= maxX; i++)
{
for (int j = minY; j <= maxY; j++)
@@ -196,20 +195,19 @@ namespace AdventOfCode2018
int areaInRange = AreaInThresold(points, DistanceThresold);
return areaInRange.ToString();
}
}
}
public class ChronoPoint
{
public class ChronoPoint
{
public int X { get; set; }
public int Y { get; set; }
public static ChronoPoint FromString(string strPoint)
{
if (string.IsNullOrEmpty(strPoint)) { return null; }
string[] parts = strPoint.Split(new string[] { ", ", }, StringSplitOptions.RemoveEmptyEntries);
string[] parts = strPoint.Split(new[] { ", ", }, StringSplitOptions.RemoveEmptyEntries);
if (parts.Length < 2) { return null; }
ChronoPoint point = new ChronoPoint
{
ChronoPoint point = new() {
X = Convert.ToInt32(parts[0]),
Y = Convert.ToInt32(parts[1]),
};
@@ -221,5 +219,4 @@ namespace AdventOfCode2018
int distance = Math.Abs(p1.X - p0.X) + Math.Abs(p1.Y - p0.Y);
return distance;
}
}
}

98
AdventOfCode2018/Day07.cs
View File

@@ -3,40 +3,39 @@ using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
--- Day 7: The Sum of Its Parts ---
--- Day 7: The Sum of Its Parts ---
You find yourself standing on a snow-covered coastline; apparently, you landed a little off course. The region is too hilly to see the North Pole from here, but you do spot some Elves that seem to be trying to unpack something that washed ashore. It's quite cold out, so you decide to risk creating a paradox by asking them for directions.
You find yourself standing on a snow-covered coastline; apparently, you landed a little off course. The region is too hilly to see the North Pole from here, but you do spot some Elves that seem to be trying to unpack something that washed ashore. It's quite cold out, so you decide to risk creating a paradox by asking them for directions.
"Oh, are you the search party?" Somehow, you can understand whatever Elves from the year 1018 speak; you assume it's Ancient Nordic Elvish. Could the device on your wrist also be a translator? "Those clothes don't look very warm; take this." They hand you a heavy coat.
"Oh, are you the search party?" Somehow, you can understand whatever Elves from the year 1018 speak; you assume it's Ancient Nordic Elvish. Could the device on your wrist also be a translator? "Those clothes don't look very warm; take this." They hand you a heavy coat.
"We do need to find our way back to the North Pole, but we have higher priorities at the moment. You see, believe it or not, this box contains something that will solve all of Santa's transportation problems - at least, that's what it looks like from the pictures in the instructions." It doesn't seem like they can read whatever language it's in, but you can: "Sleigh kit. Some assembly required."
"We do need to find our way back to the North Pole, but we have higher priorities at the moment. You see, believe it or not, this box contains something that will solve all of Santa's transportation problems - at least, that's what it looks like from the pictures in the instructions." It doesn't seem like they can read whatever language it's in, but you can: "Sleigh kit. Some assembly required."
"'Sleigh'? What a wonderful name! You must help us assemble this 'sleigh' at once!" They start excitedly pulling more parts out of the box.
"'Sleigh'? What a wonderful name! You must help us assemble this 'sleigh' at once!" They start excitedly pulling more parts out of the box.
The instructions specify a series of steps and requirements about which steps must be finished before others can begin (your puzzle input). Each step is designated by a single letter. For example, suppose you have the following instructions:
The instructions specify a series of steps and requirements about which steps must be finished before others can begin (your puzzle input). Each step is designated by a single letter. For example, suppose you have the following instructions:
Step C must be finished before step A can begin.
Step C must be finished before step F can begin.
Step A must be finished before step B can begin.
Step A must be finished before step D can begin.
Step B must be finished before step E can begin.
Step D must be finished before step E can begin.
Step F must be finished before step E can begin.
Step C must be finished before step A can begin.
Step C must be finished before step F can begin.
Step A must be finished before step B can begin.
Step A must be finished before step D can begin.
Step B must be finished before step E can begin.
Step D must be finished before step E can begin.
Step F must be finished before step E can begin.
Visually, these requirements look like this:
Visually, these requirements look like this:
-->A--->B--
/ \ \
C -->D----->E
C -->D----->E
\ /
---->F-----
Your first goal is to determine the order in which the steps should be completed. If more than one step is ready, choose the step which is first alphabetically. In this example, the steps would be completed as follows:
Your first goal is to determine the order in which the steps should be completed. If more than one step is ready, choose the step which is first alphabetically. In this example, the steps would be completed as follows:
Only C is available, and so it is done first.
Next, both A and F are available. A is first alphabetically, so it is done next.
@@ -45,19 +44,19 @@ namespace AdventOfCode2018
F is the only choice, so it is done next.
Finally, E is completed.
So, in this example, the correct order is CABDFE.
So, in this example, the correct order is CABDFE.
In what order should the steps in your instructions be completed?
In what order should the steps in your instructions be completed?
--- Part Two ---
--- Part Two ---
As you're about to begin construction, four of the Elves offer to help. "The sun will set soon; it'll go faster if we work together." Now, you need to account for multiple people working on steps simultaneously. If multiple steps are available, workers should still begin them in alphabetical order.
As you're about to begin construction, four of the Elves offer to help. "The sun will set soon; it'll go faster if we work together." Now, you need to account for multiple people working on steps simultaneously. If multiple steps are available, workers should still begin them in alphabetical order.
Each step takes 60 seconds plus an amount corresponding to its letter: A=1, B=2, C=3, and so on. So, step A takes 60+1=61 seconds, while step Z takes 60+26=86 seconds. No time is required between steps.
Each step takes 60 seconds plus an amount corresponding to its letter: A=1, B=2, C=3, and so on. So, step A takes 60+1=61 seconds, while step Z takes 60+26=86 seconds. No time is required between steps.
To simplify things for the example, however, suppose you only have help from one Elf (a total of two workers) and that each step takes 60 fewer seconds (so that step A takes 1 second and step Z takes 26 seconds). Then, using the same instructions as above, this is how each second would be spent:
To simplify things for the example, however, suppose you only have help from one Elf (a total of two workers) and that each step takes 60 fewer seconds (so that step A takes 1 second and step Z takes 26 seconds). Then, using the same instructions as above, this is how each second would be spent:
Second Worker 1 Worker 2 Done
Second Worker 1 Worker 2 Done
0 C .
1 C .
2 C .
@@ -75,25 +74,25 @@ namespace AdventOfCode2018
14 E . CABFD
15 . . CABFDE
Each row represents one second of time. The Second column identifies how many seconds have passed as of the beginning of that second. Each worker column shows the step that worker is currently doing (or . if they are idle). The Done column shows completed steps.
Each row represents one second of time. The Second column identifies how many seconds have passed as of the beginning of that second. Each worker column shows the step that worker is currently doing (or . if they are idle). The Done column shows completed steps.
Note that the order of the steps has changed; this is because steps now take time to finish and multiple workers can begin multiple steps simultaneously.
Note that the order of the steps has changed; this is because steps now take time to finish and multiple workers can begin multiple steps simultaneously.
In this example, it would take 15 seconds for two workers to complete these steps.
In this example, it would take 15 seconds for two workers to complete these steps.
With 5 workers and the 60+ second step durations described above, how long will it take to complete all of the steps?
With 5 workers and the 60+ second step durations described above, how long will it take to complete all of the steps?
*/
*/
public class Day07 : IDay
{
public class Day07 : IDay
{
private static Instructions BuildInstructions(string[] inputs, int baseCost)
{
Instructions instructions = new Instructions();
Instructions instructions = new();
foreach (string input in inputs)
{
if (string.IsNullOrEmpty(input)) { continue; }
string[] parts = input.Split(new string[] {
string[] parts = input.Split(new[] {
"Step ",
" must be finished before step ",
" can begin.",
@@ -114,7 +113,7 @@ namespace AdventOfCode2018
{
Instructions instructions = BuildInstructions(inputs, 0);
List<InstructionNode> finalInstructions = instructions.SortInstructions();
StringBuilder sbInstructions = new StringBuilder();
StringBuilder sbInstructions = new();
foreach (InstructionNode node in finalInstructions)
{
sbInstructions.Append(node.NodeID);
@@ -131,19 +130,19 @@ namespace AdventOfCode2018
int totalElapsedTime = instructions.SimulateInstructionsUsage(NumberOfWorkers);
return totalElapsedTime.ToString();
}
}
}
public class InstructionNode
{
public class InstructionNode
{
public string NodeID { get; set; }
public List<string> PreviousNodeIDs { get; } = new List<string>();
public List<string> PreviousNodeIDs { get; } = new();
public int Cost { get; set; }
public bool Running { get; set; } = false;
public bool Running { get; set; }
public bool Used { get; set; } = false;
public bool Used { get; set; }
public bool CanBeUsed(Dictionary<string, InstructionNode> allNodes)
{
@@ -151,11 +150,11 @@ namespace AdventOfCode2018
bool allPreviousUsed = PreviousNodeIDs.All(nodeID => allNodes[nodeID].Used);
return allPreviousUsed;
}
}
}
public class Instructions
{
public Dictionary<string, InstructionNode> Nodes { get; } = new Dictionary<string, InstructionNode>();
public class Instructions
{
public Dictionary<string, InstructionNode> Nodes { get; } = new();
public InstructionNode GetNode(string nodeID)
{
@@ -181,14 +180,14 @@ namespace AdventOfCode2018
public List<InstructionNode> SortInstructions()
{
List<InstructionNode> finalNodes = new List<InstructionNode>();
List<InstructionNode> finalNodes = new();
foreach (InstructionNode node in Nodes.Values)
{
node.Used = false;
}
List<InstructionNode> unusedNodes = null;
List<InstructionNode> unusedNodes;
do
{
unusedNodes = Nodes.Values
@@ -241,7 +240,7 @@ namespace AdventOfCode2018
node.Used = false;
node.Running = false;
}
List<SimulatedWorker> workers = new List<SimulatedWorker>(numberOfWorkers);
List<SimulatedWorker> workers = new(numberOfWorkers);
for (int i = 0; i < numberOfWorkers; i++)
{
workers.Add(new SimulatedWorker());
@@ -281,5 +280,4 @@ namespace AdventOfCode2018
} while (workers.Any(w => w.CurrentInstruction != null));
return totalElapsedTime;
}
}
}

88
AdventOfCode2018/Day08.cs
View File

@@ -2,20 +2,19 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
--- Day 8: Memory Maneuver ---
namespace AdventOfCode2018;
/*
--- Day 8: Memory Maneuver ---
The sleigh is much easier to pull than you'd expect for something its weight. Unfortunately, neither you nor the Elves know which way the North Pole is from here.
The sleigh is much easier to pull than you'd expect for something its weight. Unfortunately, neither you nor the Elves know which way the North Pole is from here.
You check your wrist device for anything that might help. It seems to have some kind of navigation system! Activating the navigation system produces more bad news: "Failed to start navigation system. Could not read software license file."
You check your wrist device for anything that might help. It seems to have some kind of navigation system! Activating the navigation system produces more bad news: "Failed to start navigation system. Could not read software license file."
The navigation system's license file consists of a list of numbers (your puzzle input). The numbers define a data structure which, when processed, produces some kind of tree that can be used to calculate the license number.
The navigation system's license file consists of a list of numbers (your puzzle input). The numbers define a data structure which, when processed, produces some kind of tree that can be used to calculate the license number.
The tree is made up of nodes; a single, outermost node forms the tree's root, and it contains all other nodes in the tree (or contains nodes that contain nodes, and so on).
The tree is made up of nodes; a single, outermost node forms the tree's root, and it contains all other nodes in the tree (or contains nodes that contain nodes, and so on).
Specifically, a node consists of:
Specifically, a node consists of:
A header, which is always exactly two numbers:
The quantity of child nodes.
@@ -23,50 +22,50 @@ namespace AdventOfCode2018
Zero or more child nodes (as specified in the header).
One or more metadata entries (as specified in the header).
Each child node is itself a node that has its own header, child nodes, and metadata. For example:
Each child node is itself a node that has its own header, child nodes, and metadata. For example:
2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2
A----------------------------------
2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2
A----------------------------------
B----------- C-----------
D-----
In this example, each node of the tree is also marked with an underline starting with a letter for easier identification. In it, there are four nodes:
In this example, each node of the tree is also marked with an underline starting with a letter for easier identification. In it, there are four nodes:
A, which has 2 child nodes (B, C) and 3 metadata entries (1, 1, 2).
B, which has 0 child nodes and 3 metadata entries (10, 11, 12).
C, which has 1 child node (D) and 1 metadata entry (2).
D, which has 0 child nodes and 1 metadata entry (99).
The first check done on the license file is to simply add up all of the metadata entries. In this example, that sum is 1+1+2+10+11+12+2+99=138.
The first check done on the license file is to simply add up all of the metadata entries. In this example, that sum is 1+1+2+10+11+12+2+99=138.
What is the sum of all metadata entries?
What is the sum of all metadata entries?
--- Part Two ---
--- Part Two ---
The second check is slightly more complicated: you need to find the value of the root node (A in the example above).
The second check is slightly more complicated: you need to find the value of the root node (A in the example above).
The value of a node depends on whether it has child nodes.
The value of a node depends on whether it has child nodes.
If a node has no child nodes, its value is the sum of its metadata entries. So, the value of node B is 10+11+12=33, and the value of node D is 99.
If a node has no child nodes, its value is the sum of its metadata entries. So, the value of node B is 10+11+12=33, and the value of node D is 99.
However, if a node does have child nodes, the metadata entries become indexes which refer to those child nodes. A metadata entry of 1 refers to the first child node, 2 to the second, 3 to the third, and so on. The value of this node is the sum of the values of the child nodes referenced by the metadata entries. If a referenced child node does not exist, that reference is skipped. A child node can be referenced multiple time and counts each time it is referenced. A metadata entry of 0 does not refer to any child node.
However, if a node does have child nodes, the metadata entries become indexes which refer to those child nodes. A metadata entry of 1 refers to the first child node, 2 to the second, 3 to the third, and so on. The value of this node is the sum of the values of the child nodes referenced by the metadata entries. If a referenced child node does not exist, that reference is skipped. A child node can be referenced multiple time and counts each time it is referenced. A metadata entry of 0 does not refer to any child node.
For example, again using the above nodes:
For example, again using the above nodes:
Node C has one metadata entry, 2. Because node C has only one child node, 2 references a child node which does not exist, and so the value of node C is 0.
Node A has three metadata entries: 1, 1, and 2. The 1 references node A's first child node, B, and the 2 references node A's second child node, C. Because node B has a value of 33 and node C has a value of 0, the value of node A is 33+33+0=66.
So, in this example, the value of the root node is 66.
So, in this example, the value of the root node is 66.
What is the value of the root node?
What is the value of the root node?
*/
*/
public class Day08 : IDay
{
public class Day08 : IDay
{
public string ResolvePart1(string[] inputs)
{
IntStream values = new IntStream(inputs[0]);
IntStream values = new(inputs[0]);
ChronoLicenceNode licenceTree = ChronoLicenceNode.BuildFromIntStream(values);
int result = licenceTree.GetChecksum();
return result.ToString();
@@ -74,44 +73,44 @@ namespace AdventOfCode2018
public string ResolvePart2(string[] inputs)
{
IntStream values = new IntStream(inputs[0]);
IntStream values = new(inputs[0]);
ChronoLicenceNode licenceTree = ChronoLicenceNode.BuildFromIntStream(values);
int result = licenceTree.GetValue();
return result.ToString();
}
}
}
public class IntStream
{
private int[] values;
private int index;
public class IntStream
{
private int[] _values;
private int _index;
public IntStream(string strValues)
{
values = strValues
.Split(new string[] { " ", }, StringSplitOptions.RemoveEmptyEntries)
_values = strValues
.Split(new[] { " ", }, StringSplitOptions.RemoveEmptyEntries)
.Select(strVal => Convert.ToInt32(strVal))
.ToArray();
index = 0;
_index = 0;
}
public int Get()
{
int value = values[index];
index++;
int value = _values[_index];
_index++;
return value;
}
}
}
public class ChronoLicenceNode
{
public List<ChronoLicenceNode> Childs { get; } = new List<ChronoLicenceNode>();
public class ChronoLicenceNode
{
public List<ChronoLicenceNode> Childs { get; } = new();
public List<int> Metadata { get; } = new List<int>();
public List<int> Metadata { get; } = new();
public static ChronoLicenceNode BuildFromIntStream(IntStream stream)
{
ChronoLicenceNode node = new ChronoLicenceNode();
ChronoLicenceNode node = new();
int numChilds = stream.Get();
int numMetadata = stream.Get();
@@ -157,5 +156,4 @@ namespace AdventOfCode2018
}
return value;
}
}
}

144
AdventOfCode2018/Day09.cs
View File

@@ -2,53 +2,52 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
--- Day 9: Marble Mania ---
namespace AdventOfCode2018;
/*
--- Day 9: Marble Mania ---
You talk to the Elves while you wait for your navigation system to initialize. To pass the time, they introduce you to their favorite marble game.
You talk to the Elves while you wait for your navigation system to initialize. To pass the time, they introduce you to their favorite marble game.
The Elves play this game by taking turns arranging the marbles in a circle according to very particular rules. The marbles are numbered starting with 0 and increasing by 1 until every marble has a number.
The Elves play this game by taking turns arranging the marbles in a circle according to very particular rules. The marbles are numbered starting with 0 and increasing by 1 until every marble has a number.
First, the marble numbered 0 is placed in the circle. At this point, while it contains only a single marble, it is still a circle: the marble is both clockwise from itself and counter-clockwise from itself. This marble is designated the current marble.
First, the marble numbered 0 is placed in the circle. At this point, while it contains only a single marble, it is still a circle: the marble is both clockwise from itself and counter-clockwise from itself. This marble is designated the current marble.
Then, each Elf takes a turn placing the lowest-numbered remaining marble into the circle between the marbles that are 1 and 2 marbles clockwise of the current marble. (When the circle is large enough, this means that there is one marble between the marble that was just placed and the current marble.) The marble that was just placed then becomes the current marble.
Then, each Elf takes a turn placing the lowest-numbered remaining marble into the circle between the marbles that are 1 and 2 marbles clockwise of the current marble. (When the circle is large enough, this means that there is one marble between the marble that was just placed and the current marble.) The marble that was just placed then becomes the current marble.
However, if the marble that is about to be placed has a number which is a multiple of 23, something entirely different happens. First, the current player keeps the marble they would have placed, adding it to their score. In addition, the marble 7 marbles counter-clockwise from the current marble is removed from the circle and also added to the current player's score. The marble located immediately clockwise of the marble that was removed becomes the new current marble.
However, if the marble that is about to be placed has a number which is a multiple of 23, something entirely different happens. First, the current player keeps the marble they would have placed, adding it to their score. In addition, the marble 7 marbles counter-clockwise from the current marble is removed from the circle and also added to the current player's score. The marble located immediately clockwise of the marble that was removed becomes the new current marble.
For example, suppose there are 9 players. After the marble with value 0 is placed in the middle, each player (shown in square brackets) takes a turn. The result of each of those turns would produce circles of marbles like this, where clockwise is to the right and the resulting current marble is in parentheses:
For example, suppose there are 9 players. After the marble with value 0 is placed in the middle, each player (shown in square brackets) takes a turn. The result of each of those turns would produce circles of marbles like this, where clockwise is to the right and the resulting current marble is in parentheses:
[-] (0)
[1] 0 (1)
[2] 0 (2) 1
[3] 0 2 1 (3)
[4] 0 (4) 2 1 3
[5] 0 4 2 (5) 1 3
[6] 0 4 2 5 1 (6) 3
[7] 0 4 2 5 1 6 3 (7)
[8] 0 (8) 4 2 5 1 6 3 7
[9] 0 8 4 (9) 2 5 1 6 3 7
[1] 0 8 4 9 2(10) 5 1 6 3 7
[2] 0 8 4 9 2 10 5(11) 1 6 3 7
[3] 0 8 4 9 2 10 5 11 1(12) 6 3 7
[4] 0 8 4 9 2 10 5 11 1 12 6(13) 3 7
[5] 0 8 4 9 2 10 5 11 1 12 6 13 3(14) 7
[6] 0 8 4 9 2 10 5 11 1 12 6 13 3 14 7(15)
[7] 0(16) 8 4 9 2 10 5 11 1 12 6 13 3 14 7 15
[8] 0 16 8(17) 4 9 2 10 5 11 1 12 6 13 3 14 7 15
[9] 0 16 8 17 4(18) 9 2 10 5 11 1 12 6 13 3 14 7 15
[1] 0 16 8 17 4 18 9(19) 2 10 5 11 1 12 6 13 3 14 7 15
[2] 0 16 8 17 4 18 9 19 2(20)10 5 11 1 12 6 13 3 14 7 15
[3] 0 16 8 17 4 18 9 19 2 20 10(21) 5 11 1 12 6 13 3 14 7 15
[4] 0 16 8 17 4 18 9 19 2 20 10 21 5(22)11 1 12 6 13 3 14 7 15
[5] 0 16 8 17 4 18(19) 2 20 10 21 5 22 11 1 12 6 13 3 14 7 15
[6] 0 16 8 17 4 18 19 2(24)20 10 21 5 22 11 1 12 6 13 3 14 7 15
[7] 0 16 8 17 4 18 19 2 24 20(25)10 21 5 22 11 1 12 6 13 3 14 7 15
[-] (0)
[1] 0 (1)
[2] 0 (2) 1
[3] 0 2 1 (3)
[4] 0 (4) 2 1 3
[5] 0 4 2 (5) 1 3
[6] 0 4 2 5 1 (6) 3
[7] 0 4 2 5 1 6 3 (7)
[8] 0 (8) 4 2 5 1 6 3 7
[9] 0 8 4 (9) 2 5 1 6 3 7
[1] 0 8 4 9 2(10) 5 1 6 3 7
[2] 0 8 4 9 2 10 5(11) 1 6 3 7
[3] 0 8 4 9 2 10 5 11 1(12) 6 3 7
[4] 0 8 4 9 2 10 5 11 1 12 6(13) 3 7
[5] 0 8 4 9 2 10 5 11 1 12 6 13 3(14) 7
[6] 0 8 4 9 2 10 5 11 1 12 6 13 3 14 7(15)
[7] 0(16) 8 4 9 2 10 5 11 1 12 6 13 3 14 7 15
[8] 0 16 8(17) 4 9 2 10 5 11 1 12 6 13 3 14 7 15
[9] 0 16 8 17 4(18) 9 2 10 5 11 1 12 6 13 3 14 7 15
[1] 0 16 8 17 4 18 9(19) 2 10 5 11 1 12 6 13 3 14 7 15
[2] 0 16 8 17 4 18 9 19 2(20)10 5 11 1 12 6 13 3 14 7 15
[3] 0 16 8 17 4 18 9 19 2 20 10(21) 5 11 1 12 6 13 3 14 7 15
[4] 0 16 8 17 4 18 9 19 2 20 10 21 5(22)11 1 12 6 13 3 14 7 15
[5] 0 16 8 17 4 18(19) 2 20 10 21 5 22 11 1 12 6 13 3 14 7 15
[6] 0 16 8 17 4 18 19 2(24)20 10 21 5 22 11 1 12 6 13 3 14 7 15
[7] 0 16 8 17 4 18 19 2 24 20(25)10 21 5 22 11 1 12 6 13 3 14 7 15
The goal is to be the player with the highest score after the last marble is used up. Assuming the example above ends after the marble numbered 25, the winning score is 23+9=32 (because player 5 kept marble 23 and removed marble 9, while no other player got any points in this very short example game).
The goal is to be the player with the highest score after the last marble is used up. Assuming the example above ends after the marble numbered 25, the winning score is 23+9=32 (because player 5 kept marble 23 and removed marble 9, while no other player got any points in this very short example game).
Here are a few more examples:
Here are a few more examples:
10 players; last marble is worth 1618 points: high score is 8317
13 players; last marble is worth 7999 points: high score is 146373
@@ -56,18 +55,18 @@ namespace AdventOfCode2018
21 players; last marble is worth 6111 points: high score is 54718
30 players; last marble is worth 5807 points: high score is 37305
What is the winning Elf's score?
What is the winning Elf's score?
--- Part Two ---
--- Part Two ---
Amused by the speed of your answer, the Elves are curious:
Amused by the speed of your answer, the Elves are curious:
What would the new winning Elf's score be if the number of the last marble were 100 times larger?
What would the new winning Elf's score be if the number of the last marble were 100 times larger?
*/
*/
public class Day09 : IDay
{
public class Day09 : IDay
{
public string ResolvePart1(string[] inputs)
{
return CalculateHighScore(inputs[0], 1);
@@ -80,40 +79,40 @@ namespace AdventOfCode2018
private static string CalculateHighScore(string input, long factor)
{
string[] parts = input.Split(new string[] { " players; last marble is worth ", " points" }, StringSplitOptions.RemoveEmptyEntries);
string[] parts = input.Split(new[] { " players; last marble is worth ", " points" }, StringSplitOptions.RemoveEmptyEntries);
long numberOfPlayers = Convert.ToInt32(parts[0]);
long lastMarble = Convert.ToInt32(parts[1]) * factor;
MarbleGame marbleGame = new MarbleGame();
MarbleGame marbleGame = new();
marbleGame.PlayGame(numberOfPlayers, lastMarble);
long result = marbleGame.GetHighScore();
return result.ToString();
}
}
}
public class Marble
{
public class Marble
{
public long Value { get; set; }
public Marble Previous { get; set; }
public Marble Next { get; set; }
}
}
public class MarbleGame
{
public Dictionary<long, long> Scores { get; } = new Dictionary<long, long>();
public class MarbleGame
{
public Dictionary<long, long> Scores { get; } = new();
private Marble firstMarble;
private Marble currentMarble;
private long currentPlayer = 0;
private Marble _firstMarble;
private Marble _currentMarble;
private long _currentPlayer;
private const long PointValueMultiple = 23;
public void PlayGame(long numPlayers, long lastMarble, bool showStatus = false)
{
Scores.Clear();
firstMarble = new Marble { Value = 0 };
firstMarble.Previous = firstMarble;
firstMarble.Next = firstMarble;
currentMarble = firstMarble;
_firstMarble = new Marble { Value = 0 };
_firstMarble.Previous = _firstMarble;
_firstMarble.Next = _firstMarble;
_currentMarble = _firstMarble;
for (long i = 1; i <= numPlayers; i++) { Scores.Add(i, 0); }
@@ -121,27 +120,27 @@ namespace AdventOfCode2018
{
if (showStatus) { PrintStatus(); }
currentPlayer = (i % numPlayers) + 1;
Marble newMarble = new Marble { Value = i + 1 };
_currentPlayer = (i % numPlayers) + 1;
Marble newMarble = new() { Value = i + 1 };
if ((newMarble.Value % PointValueMultiple) > 0)
{
Marble previousMarble = currentMarble.Next;
Marble previousMarble = _currentMarble.Next;
Marble nextMarble = previousMarble.Next;
newMarble.Previous = previousMarble;
newMarble.Next = nextMarble;
previousMarble.Next = newMarble;
nextMarble.Previous = newMarble;
currentMarble = newMarble;
_currentMarble = newMarble;
}
else
{
Marble marbleToRemove = currentMarble.Previous.Previous.Previous.Previous.Previous.Previous.Previous;
currentMarble = marbleToRemove.Next;
Marble marbleToRemove = _currentMarble.Previous.Previous.Previous.Previous.Previous.Previous.Previous;
_currentMarble = marbleToRemove.Next;
marbleToRemove.Previous.Next = marbleToRemove.Next;
marbleToRemove.Next.Previous = marbleToRemove.Previous;
long currentPlayerScore = Scores[currentPlayer] + (newMarble.Value + marbleToRemove.Value);
Scores[currentPlayer] = currentPlayerScore;
long currentPlayerScore = Scores[_currentPlayer] + (newMarble.Value + marbleToRemove.Value);
Scores[_currentPlayer] = currentPlayerScore;
}
}
@@ -149,11 +148,11 @@ namespace AdventOfCode2018
public void PrintStatus()
{
Console.Write("[{0}] ", currentPlayer);
Marble marble = firstMarble;
Console.Write("[{0}] ", _currentPlayer);
Marble marble = _firstMarble;
do
{
if (currentMarble.Value == marble.Value)
if (_currentMarble.Value == marble.Value)
{
Console.Write("({0}) ", marble.Value);
}
@@ -170,5 +169,4 @@ namespace AdventOfCode2018
{
return Scores.Values.Max();
}
}
}

345
AdventOfCode2018/Day10.cs
View File

@@ -3,169 +3,168 @@ using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace AdventOfCode2018
namespace AdventOfCode2018;
/*
--- Day 10: The Stars Align ---
It's no use; your navigation system simply isn't capable of providing walking directions in the arctic circle, and certainly not in 1018.
The Elves suggest an alternative. In times like these, North Pole rescue operations will arrange points of light in the sky to guide missing Elves back to base. Unfortunately, the message is easy to miss: the points move slowly enough that it takes hours to align them, but have so much momentum that they only stay aligned for a second. If you blink at the wrong time, it might be hours before another message appears.
You can see these points of light floating in the distance, and record their position in the sky and their velocity, the relative change in position per second (your puzzle input). The coordinates are all given from your perspective; given enough time, those positions and velocities will move the points into a cohesive message!
Rather than wait, you decide to fast-forward the process and calculate what the points will eventually spell.
For example, suppose you note the following points:
position=< 9, 1> velocity=< 0, 2>
position=< 7, 0> velocity=<-1, 0>
position=< 3, -2> velocity=<-1, 1>
position=< 6, 10> velocity=<-2, -1>
position=< 2, -4> velocity=< 2, 2>
position=<-6, 10> velocity=< 2, -2>
position=< 1, 8> velocity=< 1, -1>
position=< 1, 7> velocity=< 1, 0>
position=<-3, 11> velocity=< 1, -2>
position=< 7, 6> velocity=<-1, -1>
position=<-2, 3> velocity=< 1, 0>
position=<-4, 3> velocity=< 2, 0>
position=<10, -3> velocity=<-1, 1>
position=< 5, 11> velocity=< 1, -2>
position=< 4, 7> velocity=< 0, -1>
position=< 8, -2> velocity=< 0, 1>
position=<15, 0> velocity=<-2, 0>
position=< 1, 6> velocity=< 1, 0>
position=< 8, 9> velocity=< 0, -1>
position=< 3, 3> velocity=<-1, 1>
position=< 0, 5> velocity=< 0, -1>
position=<-2, 2> velocity=< 2, 0>
position=< 5, -2> velocity=< 1, 2>
position=< 1, 4> velocity=< 2, 1>
position=<-2, 7> velocity=< 2, -2>
position=< 3, 6> velocity=<-1, -1>
position=< 5, 0> velocity=< 1, 0>
position=<-6, 0> velocity=< 2, 0>
position=< 5, 9> velocity=< 1, -2>
position=<14, 7> velocity=<-2, 0>
position=<-3, 6> velocity=< 2, -1>
Each line represents one point. Positions are given as <X, Y> pairs: X represents how far left (negative) or right (positive) the point appears, while Y represents how far up (negative) or down (positive) the point appears.
At 0 seconds, each point has the position given. Each second, each point's velocity is added to its position. So, a point with velocity <1, -2> is moving to the right, but is moving upward twice as quickly. If this point's initial position were <3, 9>, after 3 seconds, its position would become <6, 3>.
Over time, the points listed above would move like this:
Initially:
........#.............
................#.....
.........#.#..#.......
......................
#..........#.#.......#
...............#......
....#.................
..#.#....#............
.......#..............
......#...............
...#...#.#...#........
....#..#..#.........#.
.......#..............
...........#..#.......
#...........#.........
...#.......#..........
After 1 second:
......................
......................
..........#....#......
........#.....#.......
..#.........#......#..
......................
......#...............
....##.........#......
......#.#.............
.....##.##..#.........
........#.#...........
........#...#.....#...
..#...........#.......
....#.....#.#.........
......................
......................
After 2 seconds:
......................
......................
......................
..............#.......
....#..#...####..#....
......................
........#....#........
......#.#.............
.......#...#..........
.......#..#..#.#......
....#....#.#..........
.....#...#...##.#.....
........#.............
......................
......................
......................
After 3 seconds:
......................
......................
......................
......................
......#...#..###......
......#...#...#.......
......#...#...#.......
......#####...#.......
......#...#...#.......
......#...#...#.......
......#...#...#.......
......#...#..###......
......................
......................
......................
......................
After 4 seconds:
......................
......................
......................
............#.........
........##...#.#......
......#.....#..#......
.....#..##.##.#.......
.......##.#....#......
...........#....#.....
..............#.......
....#......#...#......
.....#.....##.........
...............#......
...............#......
......................
......................
After 3 seconds, the message appeared briefly: HI. Of course, your message will be much longer and will take many more seconds to appear.
What message will eventually appear in the sky?
--- Part Two ---
Good thing you didn't have to wait, because that would have taken a long time - much longer than the 3 seconds in the example above.
Impressed by your sub-hour communication capabilities, the Elves are curious: exactly how many seconds would they have needed to wait for that message to appear?
*/
public class Day10 : IDay
{
/*
--- Day 10: The Stars Align ---
It's no use; your navigation system simply isn't capable of providing walking directions in the arctic circle, and certainly not in 1018.
The Elves suggest an alternative. In times like these, North Pole rescue operations will arrange points of light in the sky to guide missing Elves back to base. Unfortunately, the message is easy to miss: the points move slowly enough that it takes hours to align them, but have so much momentum that they only stay aligned for a second. If you blink at the wrong time, it might be hours before another message appears.
You can see these points of light floating in the distance, and record their position in the sky and their velocity, the relative change in position per second (your puzzle input). The coordinates are all given from your perspective; given enough time, those positions and velocities will move the points into a cohesive message!
Rather than wait, you decide to fast-forward the process and calculate what the points will eventually spell.
For example, suppose you note the following points:
position=< 9, 1> velocity=< 0, 2>
position=< 7, 0> velocity=<-1, 0>
position=< 3, -2> velocity=<-1, 1>
position=< 6, 10> velocity=<-2, -1>
position=< 2, -4> velocity=< 2, 2>
position=<-6, 10> velocity=< 2, -2>
position=< 1, 8> velocity=< 1, -1>
position=< 1, 7> velocity=< 1, 0>
position=<-3, 11> velocity=< 1, -2>
position=< 7, 6> velocity=<-1, -1>
position=<-2, 3> velocity=< 1, 0>
position=<-4, 3> velocity=< 2, 0>
position=<10, -3> velocity=<-1, 1>
position=< 5, 11> velocity=< 1, -2>
position=< 4, 7> velocity=< 0, -1>
position=< 8, -2> velocity=< 0, 1>
position=<15, 0> velocity=<-2, 0>
position=< 1, 6> velocity=< 1, 0>
position=< 8, 9> velocity=< 0, -1>
position=< 3, 3> velocity=<-1, 1>
position=< 0, 5> velocity=< 0, -1>
position=<-2, 2> velocity=< 2, 0>
position=< 5, -2> velocity=< 1, 2>
position=< 1, 4> velocity=< 2, 1>
position=<-2, 7> velocity=< 2, -2>
position=< 3, 6> velocity=<-1, -1>
position=< 5, 0> velocity=< 1, 0>
position=<-6, 0> velocity=< 2, 0>
position=< 5, 9> velocity=< 1, -2>
position=<14, 7> velocity=<-2, 0>
position=<-3, 6> velocity=< 2, -1>
Each line represents one point. Positions are given as <X, Y> pairs: X represents how far left (negative) or right (positive) the point appears, while Y represents how far up (negative) or down (positive) the point appears.
At 0 seconds, each point has the position given. Each second, each point's velocity is added to its position. So, a point with velocity <1, -2> is moving to the right, but is moving upward twice as quickly. If this point's initial position were <3, 9>, after 3 seconds, its position would become <6, 3>.
Over time, the points listed above would move like this:
Initially:
........#.............
................#.....
.........#.#..#.......
......................
#..........#.#.......#
...............#......
....#.................
..#.#....#............
.......#..............
......#...............
...#...#.#...#........
....#..#..#.........#.
.......#..............
...........#..#.......
#...........#.........
...#.......#..........
After 1 second:
......................
......................
..........#....#......
........#.....#.......
..#.........#......#..
......................
......#...............
....##.........#......
......#.#.............
.....##.##..#.........
........#.#...........
........#...#.....#...
..#...........#.......
....#.....#.#.........
......................
......................
After 2 seconds:
......................
......................
......................
..............#.......
....#..#...####..#....
......................
........#....#........
......#.#.............
.......#...#..........
.......#..#..#.#......
....#....#.#..........
.....#...#...##.#.....
........#.............
......................
......................
......................
After 3 seconds:
......................
......................
......................
......................
......#...#..###......
......#...#...#.......
......#...#...#.......
......#####...#.......
......#...#...#.......
......#...#...#.......
......#...#...#.......
......#...#..###......
......................
......................
......................
......................
After 4 seconds:
......................
......................
......................
............#.........
........##...#.#......
......#.....#..#......
.....#..##.##.#.......
.......##.#....#......
...........#....#.....
..............#.......
....#......#...#......
.....#.....##.........
...............#......
...............#......
......................
......................
After 3 seconds, the message appeared briefly: HI. Of course, your message will be much longer and will take many more seconds to appear.
What message will eventually appear in the sky?
--- Part Two ---
Good thing you didn't have to wait, because that would have taken a long time - much longer than the 3 seconds in the example above.
Impressed by your sub-hour communication capabilities, the Elves are curious: exactly how many seconds would they have needed to wait for that message to appear?
*/
public class Day10 : IDay
{
public int Width { get; set; } = 65;
public int Height { get; set; } = 12;
public string ResolvePart1(string[] inputs)
{
LightField lightField = new LightField(inputs);
LightField lightField = new(inputs);
int t = lightField.SearchSmallerBoundindBox();
string result = lightField.Render(t, Width, Height);
return result;
@@ -173,14 +172,14 @@ namespace AdventOfCode2018
public string ResolvePart2(string[] inputs)
{
LightField lightField = new LightField(inputs);
LightField lightField = new(inputs);
int t = lightField.SearchSmallerBoundindBox();
return t.ToString();
}
}
}
public class LightPoint
{
public class LightPoint
{
public int X { get; set; }
public int Y { get; set; }
public int VX { get; set; }
@@ -188,9 +187,8 @@ namespace AdventOfCode2018
public static LightPoint FromString(string strPoint)
{
string[] parts = strPoint.Split(new string[] { "position=<", " ", ",", "> velocity=<", ">" }, StringSplitOptions.RemoveEmptyEntries);
LightPoint point = new LightPoint
{
string[] parts = strPoint.Split(new[] { "position=<", " ", ",", "> velocity=<", ">" }, StringSplitOptions.RemoveEmptyEntries);
LightPoint point = new() {
X = Convert.ToInt32(parts[0]),
Y = Convert.ToInt32(parts[1]),
VX = Convert.ToInt32(parts[2]),
@@ -208,15 +206,15 @@ namespace AdventOfCode2018
{
return Y + (VY * t);
}
}
}
public class LightField
{
private List<LightPoint> points;
public class LightField
{
private readonly List<LightPoint> _points;
public LightField(string[] strPoints)
{
points = strPoints.Select(strPoint => LightPoint.FromString(strPoint)).ToList();
_points = strPoints.Select(strPoint => LightPoint.FromString(strPoint)).ToList();
}
public int SearchSmallerBoundindBox()
@@ -229,7 +227,7 @@ namespace AdventOfCode2018
{
int minY = int.MaxValue;
int maxY = int.MinValue;
foreach (LightPoint point in points)
foreach (LightPoint point in _points)
{
int y = point.GetY(t);
if (y < minY) { minY = y; }
@@ -259,7 +257,7 @@ namespace AdventOfCode2018
int maxX = int.MinValue;
int maxY = int.MinValue;
foreach (LightPoint point in points)
foreach (LightPoint point in _points)
{
int x = point.GetX(t);
int y = point.GetY(t);
@@ -277,7 +275,7 @@ namespace AdventOfCode2018
double scaleY = (maxY - minY) / (double)height;
int[,] field = new int[width, height];
foreach (LightPoint point in points)
foreach (LightPoint point in _points)
{
int x = point.GetX(t);
int y = point.GetY(t);
@@ -288,7 +286,7 @@ namespace AdventOfCode2018
field[x, y]++;
}
StringBuilder sb = new StringBuilder();
StringBuilder sb = new();
for (int j = 0; j < height; j++)
{
sb.AppendLine();
@@ -306,5 +304,4 @@ namespace AdventOfCode2018
}
return sb.ToString();
}
}
}

66
AdventOfCode2018/Day11.cs
View File

@@ -1,22 +1,21 @@
using System;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
--- Day 11: Chronal Charge ---
--- Day 11: Chronal Charge ---
You watch the Elves and their sleigh fade into the distance as they head toward the North Pole.
You watch the Elves and their sleigh fade into the distance as they head toward the North Pole.
Actually, you're the one fading. The falling sensation returns.
Actually, you're the one fading. The falling sensation returns.
The low fuel warning light is illuminated on your wrist-mounted device. Tapping it once causes it to project a hologram of the situation: a 300x300 grid of fuel cells and their current power levels, some negative. You're not sure what negative power means in the context of time travel, but it can't be good.
The low fuel warning light is illuminated on your wrist-mounted device. Tapping it once causes it to project a hologram of the situation: a 300x300 grid of fuel cells and their current power levels, some negative. You're not sure what negative power means in the context of time travel, but it can't be good.
Each fuel cell has a coordinate ranging from 1 to 300 in both the X (horizontal) and Y (vertical) direction. In X,Y notation, the top-left cell is 1,1, and the top-right cell is 300,1.
Each fuel cell has a coordinate ranging from 1 to 300 in both the X (horizontal) and Y (vertical) direction. In X,Y notation, the top-left cell is 1,1, and the top-right cell is 300,1.
The interface lets you select any 3x3 square of fuel cells. To increase your chances of getting to your destination, you decide to choose the 3x3 square with the largest total power.
The interface lets you select any 3x3 square of fuel cells. To increase your chances of getting to your destination, you decide to choose the 3x3 square with the largest total power.
The power level in a given fuel cell can be found through the following process:
The power level in a given fuel cell can be found through the following process:
Find the fuel cell's rack ID, which is its X coordinate plus 10.
Begin with a power level of the rack ID times the Y coordinate.
@@ -25,7 +24,7 @@ namespace AdventOfCode2018
Keep only the hundreds digit of the power level (so 12345 becomes 3; numbers with no hundreds digit become 0).
Subtract 5 from the power level.
For example, to find the power level of the fuel cell at 3,5 in a grid with serial number 8:
For example, to find the power level of the fuel cell at 3,5 in a grid with serial number 8:
The rack ID is 3 + 10 = 13.
The power level starts at 13 * 5 = 65.
@@ -34,63 +33,63 @@ namespace AdventOfCode2018
The hundreds digit of 949 is 9.
Subtracting 5 produces 9 - 5 = 4.
So, the power level of this fuel cell is 4.
So, the power level of this fuel cell is 4.
Here are some more example power levels:
Here are some more example power levels:
Fuel cell at 122,79, grid serial number 57: power level -5.
Fuel cell at 217,196, grid serial number 39: power level 0.
Fuel cell at 101,153, grid serial number 71: power level 4.
Your goal is to find the 3x3 square which has the largest total power. The square must be entirely within the 300x300 grid. Identify this square using the X,Y coordinate of its top-left fuel cell. For example:
Your goal is to find the 3x3 square which has the largest total power. The square must be entirely within the 300x300 grid. Identify this square using the X,Y coordinate of its top-left fuel cell. For example:
For grid serial number 18, the largest total 3x3 square has a top-left corner of 33,45 (with a total power of 29); these fuel cells appear in the middle of this 5x5 region:
For grid serial number 18, the largest total 3x3 square has a top-left corner of 33,45 (with a total power of 29); these fuel cells appear in the middle of this 5x5 region:
-2 -4 4 4 4
-4 4 4 4 -5
-2 -4 4 4 4
-4 4 4 4 -5
4 3 3 4 -4
1 1 2 4 -3
-1 0 2 -5 -2
-1 0 2 -5 -2
For grid serial number 42, the largest 3x3 square's top-left is 21,61 (with a total power of 30); they are in the middle of this region:
For grid serial number 42, the largest 3x3 square's top-left is 21,61 (with a total power of 30); they are in the middle of this region:
-3 4 2 2 2
-4 4 3 3 4
-5 3 3 4 -4
-3 4 2 2 2
-4 4 3 3 4
-5 3 3 4 -4
4 3 3 4 -3
3 3 3 -5 -1
What is the X,Y coordinate of the top-left fuel cell of the 3x3 square with the largest total power?
What is the X,Y coordinate of the top-left fuel cell of the 3x3 square with the largest total power?
--- Part Two ---
--- Part Two ---
You discover a dial on the side of the device; it seems to let you select a square of any size, not just 3x3. Sizes from 1x1 to 300x300 are supported.
You discover a dial on the side of the device; it seems to let you select a square of any size, not just 3x3. Sizes from 1x1 to 300x300 are supported.
Realizing this, you now must find the square of any size with the largest total power. Identify this square by including its size as a third parameter after the top-left coordinate: a 9x9 square with a top-left corner of 3,5 is identified as 3,5,9.
Realizing this, you now must find the square of any size with the largest total power. Identify this square by including its size as a third parameter after the top-left coordinate: a 9x9 square with a top-left corner of 3,5 is identified as 3,5,9.
For example:
For example:
For grid serial number 18, the largest total square (with a total power of 113) is 16x16 and has a top-left corner of 90,269, so its identifier is 90,269,16.
For grid serial number 42, the largest total square (with a total power of 119) is 12x12 and has a top-left corner of 232,251, so its identifier is 232,251,12.
What is the X,Y,size identifier of the square with the largest total power?
What is the X,Y,size identifier of the square with the largest total power?
*/
*/
public class Day11 : IDay
{
public class Day11 : IDay
{
public string ResolvePart1(string[] inputs)
{
int serial = Convert.ToInt32(inputs[0]);
SearchBestRegionOfOneSize(300, 300, 3, serial, out int x, out int y);
return string.Format("{0},{1}", x, y);
return $"{x},{y}";
}
public string ResolvePart2(string[] inputs)
{
int serial = Convert.ToInt32(inputs[0]);
SearchBestRegion(300, 300, serial, out int x, out int y, out int size);
return string.Format("{0},{1},{2}", x, y, size);
return $"{x},{y},{size}";
}
public static int CalculatePowerLevelOfCell(int x, int y, int serial)
@@ -222,5 +221,4 @@ namespace AdventOfCode2018
y = bestY;
size = bestSize;
}
}
}

104
AdventOfCode2018/Day12.cs
View File

@@ -1,45 +1,44 @@
using System;
using System.Collections.Generic;
namespace AdventOfCode2018
{
/*
--- Day 12: Subterranean Sustainability ---
namespace AdventOfCode2018;
/*
--- Day 12: Subterranean Sustainability ---
The year 518 is significantly more underground than your history books implied. Either that, or you've arrived in a vast cavern network under the North Pole.
The year 518 is significantly more underground than your history books implied. Either that, or you've arrived in a vast cavern network under the North Pole.
After exploring a little, you discover a long tunnel that contains a row of small pots as far as you can see to your left and right. A few of them contain plants - someone is trying to grow things in these geothermally-heated caves.
After exploring a little, you discover a long tunnel that contains a row of small pots as far as you can see to your left and right. A few of them contain plants - someone is trying to grow things in these geothermally-heated caves.
The pots are numbered, with 0 in front of you. To the left, the pots are numbered -1, -2, -3, and so on; to the right, 1, 2, 3.... Your puzzle input contains a list of pots from 0 to the right and whether they do (#) or do not (.) currently contain a plant, the initial state. (No other pots currently contain plants.) For example, an initial state of #..##.... indicates that pots 0, 3, and 4 currently contain plants.
The pots are numbered, with 0 in front of you. To the left, the pots are numbered -1, -2, -3, and so on; to the right, 1, 2, 3.... Your puzzle input contains a list of pots from 0 to the right and whether they do (#) or do not (.) currently contain a plant, the initial state. (No other pots currently contain plants.) For example, an initial state of #..##.... indicates that pots 0, 3, and 4 currently contain plants.
Your puzzle input also contains some notes you find on a nearby table: someone has been trying to figure out how these plants spread to nearby pots. Based on the notes, for each generation of plants, a given pot has or does not have a plant based on whether that pot (and the two pots on either side of it) had a plant in the last generation. These are written as LLCRR => N, where L are pots to the left, C is the current pot being considered, R are the pots to the right, and N is whether the current pot will have a plant in the next generation. For example:
Your puzzle input also contains some notes you find on a nearby table: someone has been trying to figure out how these plants spread to nearby pots. Based on the notes, for each generation of plants, a given pot has or does not have a plant based on whether that pot (and the two pots on either side of it) had a plant in the last generation. These are written as LLCRR => N, where L are pots to the left, C is the current pot being considered, R are the pots to the right, and N is whether the current pot will have a plant in the next generation. For example:
A note like ..#.. => . means that a pot that contains a plant but with no plants within two pots of it will not have a plant in it during the next generation.
A note like ##.## => . means that an empty pot with two plants on each side of it will remain empty in the next generation.
A note like .##.# => # means that a pot has a plant in a given generation if, in the previous generation, there were plants in that pot, the one immediately to the left, and the one two pots to the right, but not in the ones immediately to the right and two to the left.
It's not clear what these plants are for, but you're sure it's important, so you'd like to make sure the current configuration of plants is sustainable by determining what will happen after 20 generations.
It's not clear what these plants are for, but you're sure it's important, so you'd like to make sure the current configuration of plants is sustainable by determining what will happen after 20 generations.
For example, given the following input:
For example, given the following input:
initial state: #..#.#..##......###...###
initial state: #..#.#..##......###...###
...## => #
..#.. => #
.#... => #
.#.#. => #
.#.## => #
.##.. => #
.#### => #
#.#.# => #
#.### => #
##.#. => #
##.## => #
###.. => #
###.# => #
####. => #
...## => #
..#.. => #
.#... => #
.#.#. => #
.#.## => #
.##.. => #
.#### => #
#.#.# => #
#.### => #
##.#. => #
##.## => #
###.. => #
###.# => #
####. => #
For brevity, in this example, only the combinations which do produce a plant are listed. (Your input includes all possible combinations.) Then, the next 20 generations will look like this:
For brevity, in this example, only the combinations which do produce a plant are listed. (Your input includes all possible combinations.) Then, the next 20 generations will look like this:
1 2 3
0 0 0 0
@@ -53,36 +52,36 @@ namespace AdventOfCode2018
7: ...#..###.#...##..#...#...#...#........
8: ...#....##.#.#.#..##..##..##..##.......
9: ...##..#..#####....#...#...#...#.......
10: ..#.#..#...#.##....##..##..##..##......
11: ...#...##...#.#...#.#...#...#...#......
12: ...##.#.#....#.#...#.#..##..##..##.....
13: ..#..###.#....#.#...#....#...#...#.....
14: ..#....##.#....#.#..##...##..##..##....
15: ..##..#..#.#....#....#..#.#...#...#....
16: .#.#..#...#.#...##...#...#.#..##..##...
17: ..#...##...#.#.#.#...##...#....#...#...
18: ..##.#.#....#####.#.#.#...##...##..##..
19: .#..###.#..#.#.#######.#.#.#..#.#...#..
20: .#....##....#####...#######....#.#..##.
10: ..#.#..#...#.##....##..##..##..##......
11: ...#...##...#.#...#.#...#...#...#......
12: ...##.#.#....#.#...#.#..##..##..##.....
13: ..#..###.#....#.#...#....#...#...#.....
14: ..#....##.#....#.#..##...##..##..##....
15: ..##..#..#.#....#....#..#.#...#...#....
16: .#.#..#...#.#...##...#...#.#..##..##...
17: ..#...##...#.#.#.#...##...#....#...#...
18: ..##.#.#....#####.#.#.#...##...##..##..
19: .#..###.#..#.#.#######.#.#.#..#.#...#..
20: .#....##....#####...#######....#.#..##.
The generation is shown along the left, where 0 is the initial state. The pot numbers are shown along the top, where 0 labels the center pot, negative-numbered pots extend to the left, and positive pots extend toward the right. Remember, the initial state begins at pot 0, which is not the leftmost pot used in this example.
The generation is shown along the left, where 0 is the initial state. The pot numbers are shown along the top, where 0 labels the center pot, negative-numbered pots extend to the left, and positive pots extend toward the right. Remember, the initial state begins at pot 0, which is not the leftmost pot used in this example.
After one generation, only seven plants remain. The one in pot 0 matched the rule looking for ..#.., the one in pot 4 matched the rule looking for .#.#., pot 9 matched .##.., and so on.
After one generation, only seven plants remain. The one in pot 0 matched the rule looking for ..#.., the one in pot 4 matched the rule looking for .#.#., pot 9 matched .##.., and so on.
In this example, after 20 generations, the pots shown as # contain plants, the furthest left of which is pot -2, and the furthest right of which is pot 34. Adding up all the numbers of plant-containing pots after the 20th generation produces 325.
In this example, after 20 generations, the pots shown as # contain plants, the furthest left of which is pot -2, and the furthest right of which is pot 34. Adding up all the numbers of plant-containing pots after the 20th generation produces 325.
After 20 generations, what is the sum of the numbers of all pots which contain a plant?
After 20 generations, what is the sum of the numbers of all pots which contain a plant?
--- Part Two ---
--- Part Two ---
You realize that 20 generations aren't enough. After all, these plants will need to last another 1500 years to even reach your timeline, not to mention your future.
You realize that 20 generations aren't enough. After all, these plants will need to last another 1500 years to even reach your timeline, not to mention your future.
After fifty billion (50000000000) generations, what is the sum of the numbers of all pots which contain a plant?
After fifty billion (50000000000) generations, what is the sum of the numbers of all pots which contain a plant?
*/
*/
public class Day12 : IDay
{
public class Day12 : IDay
{
public string ResolvePart1(string[] inputs)
{
Initialize(inputs);
@@ -93,7 +92,7 @@ namespace AdventOfCode2018
public string ResolvePart2(string[] inputs)
{
Initialize(inputs);
Simulate(500, false);
Simulate(500);
_offsetField -= (50000000000L - 500);
return CalculateChecksum().ToString();
}
@@ -112,9 +111,9 @@ namespace AdventOfCode2018
private const int SideMargin = 5;
private const int SideProcessMargin = 2;
private List<bool> _initialState = new List<bool>();
private List<PlantRule> _rules = new List<PlantRule>();
private long _offsetField = 0;
private List<bool> _initialState = new();
private List<PlantRule> _rules = new();
private long _offsetField;
private bool[] _field;
private bool[] _workField;
@@ -130,7 +129,7 @@ namespace AdventOfCode2018
for (int i = 2; i < inputs.Length; i++)
{
if (string.IsNullOrEmpty(inputs[i])) { continue; }
string[] parts = inputs[i].Split(new string[] { " => " }, StringSplitOptions.RemoveEmptyEntries);
string[] parts = inputs[i].Split(new[] { " => " }, StringSplitOptions.RemoveEmptyEntries);
_rules.Add(new PlantRule
{
Minus2 = (parts[0][0] == '#'),
@@ -279,5 +278,4 @@ namespace AdventOfCode2018
}
return sum;
}
}
}

304
AdventOfCode2018/Day13.cs
View File

@@ -2,245 +2,244 @@
using System.Collections.Generic;
using System.Linq;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
--- Day 13: Mine Cart Madness ---
--- Day 13: Mine Cart Madness ---
A crop of this size requires significant logistics to transport produce, soil, fertilizer, and so on. The Elves are very busy pushing things around in carts on some kind of rudimentary system of tracks they've come up with.
A crop of this size requires significant logistics to transport produce, soil, fertilizer, and so on. The Elves are very busy pushing things around in carts on some kind of rudimentary system of tracks they've come up with.
Seeing as how cart-and-track systems don't appear in recorded history for another 1000 years, the Elves seem to be making this up as they go along. They haven't even figured out how to avoid collisions yet.
Seeing as how cart-and-track systems don't appear in recorded history for another 1000 years, the Elves seem to be making this up as they go along. They haven't even figured out how to avoid collisions yet.
You map out the tracks (your puzzle input) and see where you can help.
You map out the tracks (your puzzle input) and see where you can help.
Tracks consist of straight paths (| and -), curves (/ and \), and intersections (+). Curves connect exactly two perpendicular pieces of track; for example, this is a closed loop:
Tracks consist of straight paths (| and -), curves (/ and \), and intersections (+). Curves connect exactly two perpendicular pieces of track; for example, this is a closed loop:
/----\
| |
| |
\----/
/----\
| |
| |
\----/
Intersections occur when two perpendicular paths cross. At an intersection, a cart is capable of turning left, turning right, or continuing straight. Here are two loops connected by two intersections:
Intersections occur when two perpendicular paths cross. At an intersection, a cart is capable of turning left, turning right, or continuing straight. Here are two loops connected by two intersections:
/-----\
| |
| /--+--\
| | | |
\--+--/ |
/-----\
| |
| /--+--\
| | | |
\--+--/ |
| |
\-----/
Several carts are also on the tracks. Carts always face either up (^), down (v), left (<), or right (>). (On your initial map, the track under each cart is a straight path matching the direction the cart is facing.)
Several carts are also on the tracks. Carts always face either up (^), down (v), left (<), or right (>). (On your initial map, the track under each cart is a straight path matching the direction the cart is facing.)
Each time a cart has the option to turn (by arriving at any intersection), it turns left the first time, goes straight the second time, turns right the third time, and then repeats those directions starting again with left the fourth time, straight the fifth time, and so on. This process is independent of the particular intersection at which the cart has arrived - that is, the cart has no per-intersection memory.
Each time a cart has the option to turn (by arriving at any intersection), it turns left the first time, goes straight the second time, turns right the third time, and then repeats those directions starting again with left the fourth time, straight the fifth time, and so on. This process is independent of the particular intersection at which the cart has arrived - that is, the cart has no per-intersection memory.
Carts all move at the same speed; they take turns moving a single step at a time. They do this based on their current location: carts on the top row move first (acting from left to right), then carts on the second row move (again from left to right), then carts on the third row, and so on. Once each cart has moved one step, the process repeats; each of these loops is called a tick.
Carts all move at the same speed; they take turns moving a single step at a time. They do this based on their current location: carts on the top row move first (acting from left to right), then carts on the second row move (again from left to right), then carts on the third row, and so on. Once each cart has moved one step, the process repeats; each of these loops is called a tick.
For example, suppose there are two carts on a straight track:
For example, suppose there are two carts on a straight track:
| | | | |
v | | | |
| v v | |
| | | v X
| | ^ ^ |
^ ^ | | |
| | | | |
| | | | |
v | | | |
| v v | |
| | | v X
| | ^ ^ |
^ ^ | | |
| | | | |
First, the top cart moves. It is facing down (v), so it moves down one square. Second, the bottom cart moves. It is facing up (^), so it moves up one square. Because all carts have moved, the first tick ends. Then, the process repeats, starting with the first cart. The first cart moves down, then the second cart moves up - right into the first cart, colliding with it! (The location of the crash is marked with an X.) This ends the second and last tick.
First, the top cart moves. It is facing down (v), so it moves down one square. Second, the bottom cart moves. It is facing up (^), so it moves up one square. Because all carts have moved, the first tick ends. Then, the process repeats, starting with the first cart. The first cart moves down, then the second cart moves up - right into the first cart, colliding with it! (The location of the crash is marked with an X.) This ends the second and last tick.
Here is a longer example:
Here is a longer example:
/->-\
| | /----\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
/->-\
| | /----\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
\------/
/-->\
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \->--/
/-->\
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \->--/
\------/
/---v
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+>-/
/---v
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+>-/
\------/
/---\
| v /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+->/
/---\
| v /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+->/
\------/
/---\
| | /----\
| /->--+-\ |
| | | | | |
\-+-/ \-+--^
/---\
| | /----\
| /->--+-\ |
| | | | | |
\-+-/ \-+--^
\------/
/---\
| | /----\
| /-+>-+-\ |
| | | | | ^
\-+-/ \-+--/
/---\
| | /----\
| /-+>-+-\ |
| | | | | ^
\-+-/ \-+--/
\------/
/---\
| | /----\
| /-+->+-\ ^
| | | | | |
\-+-/ \-+--/
/---\
| | /----\
| /-+->+-\ ^
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /----<
| /-+-->-\ |
| | | | | |
\-+-/ \-+--/
/---\
| | /----<
| /-+-->-\ |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /---<\
| /-+--+>\ |
| | | | | |
\-+-/ \-+--/
/---\
| | /---<\
| /-+--+>\ |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /--<-\
| /-+--+-v |
| | | | | |
\-+-/ \-+--/
/---\
| | /--<-\
| /-+--+-v |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /-<--\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
/---\
| | /-<--\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
\------/
/---\
| | /<---\
| /-+--+-\ |
| | | | | |
\-+-/ \-<--/
/---\
| | /<---\
| /-+--+-\ |
| | | | | |
\-+-/ \-<--/
\------/
/---\
| | v----\
| /-+--+-\ |
| | | | | |
\-+-/ \<+--/
/---\
| | v----\
| /-+--+-\ |
| | | | | |
\-+-/ \<+--/
\------/
/---\
| | /----\
| /-+--v-\ |
| | | | | |
\-+-/ ^-+--/
/---\
| | /----\
| /-+--v-\ |
| | | | | |
\-+-/ ^-+--/
\------/
/---\
| | /----\
| /-+--+-\ |
| | | X | |
\-+-/ \-+--/
/---\
| | /----\
| /-+--+-\ |
| | | X | |
\-+-/ \-+--/
\------/
After following their respective paths for a while, the carts eventually crash. To help prevent crashes, you'd like to know the location of the first crash. Locations are given in X,Y coordinates, where the furthest left column is X=0 and the furthest top row is Y=0:
After following their respective paths for a while, the carts eventually crash. To help prevent crashes, you'd like to know the location of the first crash. Locations are given in X,Y coordinates, where the furthest left column is X=0 and the furthest top row is Y=0:
111
0123456789012
0/---\
1| | /----\
2| /-+--+-\ |
3| | | X | |
4\-+-/ \-+--/
5 \------/
0/---\
1| | /----\
2| /-+--+-\ |
3| | | X | |
4\-+-/ \-+--/
5 \------/
In this example, the location of the first crash is 7,3.
In this example, the location of the first crash is 7,3.
--- Part Two ---
--- Part Two ---
There isn't much you can do to prevent crashes in this ridiculous system. However, by predicting the crashes, the Elves know where to be in advance and instantly remove the two crashing carts the moment any crash occurs.
There isn't much you can do to prevent crashes in this ridiculous system. However, by predicting the crashes, the Elves know where to be in advance and instantly remove the two crashing carts the moment any crash occurs.
They can proceed like this for a while, but eventually, they're going to run out of carts. It could be useful to figure out where the last cart that hasn't crashed will end up.
They can proceed like this for a while, but eventually, they're going to run out of carts. It could be useful to figure out where the last cart that hasn't crashed will end up.
For example:
For example:
/>-<\
| |
| /<+-\
| | | v
\>+</ |
/>-<\
| |
| /<+-\
| | | v
\>+</ |
| ^
\<->/
/---\
| |
| v-+-\
| | | |
\-+-/ |
/---\
| |
| v-+-\
| | | |
\-+-/ |
| |
^---^
/---\
| |
| /-+-\
| v | |
\-+-/ |
/---\
| |
| /-+-\
| v | |
\-+-/ |
^ ^
\---/
/---\
| |
| /-+-\
| | | |
\-+-/ ^
/---\
| |
| /-+-\
| | | |
\-+-/ ^
| |
\---/
After four very expensive crashes, a tick ends with only one cart remaining; its final location is 6,4.
After four very expensive crashes, a tick ends with only one cart remaining; its final location is 6,4.
What is the location of the last cart at the end of the first tick where it is the only cart left?
What is the location of the last cart at the end of the first tick where it is the only cart left?
*/
*/
public class Day13 : IDay
{
public class Day13 : IDay
{
private bool ShowProgress { get; set; } = false;
public string ResolvePart1(string[] inputs)
{
Initialize(inputs);
Train colidingTrain = null;
Train collidingTrain;
do
{
if (ShowProgress) { ShowGrid(); }
colidingTrain = SimulateForFirstCollision();
} while (colidingTrain == null);
return string.Format("{0},{1}", colidingTrain.X, colidingTrain.Y);
collidingTrain = SimulateForFirstCollision();
} while (collidingTrain == null);
return $"{collidingTrain.X},{collidingTrain.Y}";
}
public string ResolvePart2(string[] inputs)
{
Initialize(inputs);
Train lastCart = null;
Train lastCart;
do
{
if (ShowProgress) { ShowGrid(); }
lastCart = SimulateForLastCart();
} while (lastCart == null);
return string.Format("{0},{1}", lastCart.X, lastCart.Y);
return $"{lastCart.X},{lastCart.Y}";
}
private enum TrainDirection
@@ -249,7 +248,7 @@ namespace AdventOfCode2018
South,
East,
West,
};
}
private enum TrainTurning
{
@@ -376,8 +375,8 @@ namespace AdventOfCode2018
private int _width;
private int _height;
private char[,] _grid = null;
private List<Train> _trains = new List<Train>();
private char[,] _grid;
private List<Train> _trains = new();
private void Initialize(string[] inputs)
{
@@ -508,5 +507,4 @@ namespace AdventOfCode2018
}
}
}
}

60
AdventOfCode2018/Day14.cs
View File

@@ -2,31 +2,30 @@
using System.Linq;
using System.Text;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
*
--- Day 14: Chocolate Charts ---
--- Day 14: Chocolate Charts ---
You finally have a chance to look at all of the produce moving around. Chocolate, cinnamon, mint, chili peppers, nutmeg, vanilla... the Elves must be growing these plants to make hot chocolate! As you realize this, you hear a conversation in the distance. When you go to investigate, you discover two Elves in what appears to be a makeshift underground kitchen/laboratory.
You finally have a chance to look at all of the produce moving around. Chocolate, cinnamon, mint, chili peppers, nutmeg, vanilla... the Elves must be growing these plants to make hot chocolate! As you realize this, you hear a conversation in the distance. When you go to investigate, you discover two Elves in what appears to be a makeshift underground kitchen/laboratory.
The Elves are trying to come up with the ultimate hot chocolate recipe; they're even maintaining a scoreboard which tracks the quality score (0-9) of each recipe.
The Elves are trying to come up with the ultimate hot chocolate recipe; they're even maintaining a scoreboard which tracks the quality score (0-9) of each recipe.
Only two recipes are on the board: the first recipe got a score of 3, the second, 7. Each of the two Elves has a current recipe: the first Elf starts with the first recipe, and the second Elf starts with the second recipe.
Only two recipes are on the board: the first recipe got a score of 3, the second, 7. Each of the two Elves has a current recipe: the first Elf starts with the first recipe, and the second Elf starts with the second recipe.
To create new recipes, the two Elves combine their current recipes. This creates new recipes from the digits of the sum of the current recipes' scores. With the current recipes' scores of 3 and 7, their sum is 10, and so two new recipes would be created: the first with score 1 and the second with score 0. If the current recipes' scores were 2 and 3, the sum, 5, would only create one recipe (with a score of 5) with its single digit.
To create new recipes, the two Elves combine their current recipes. This creates new recipes from the digits of the sum of the current recipes' scores. With the current recipes' scores of 3 and 7, their sum is 10, and so two new recipes would be created: the first with score 1 and the second with score 0. If the current recipes' scores were 2 and 3, the sum, 5, would only create one recipe (with a score of 5) with its single digit.
The new recipes are added to the end of the scoreboard in the order they are created. So, after the first round, the scoreboard is 3, 7, 1, 0.
The new recipes are added to the end of the scoreboard in the order they are created. So, after the first round, the scoreboard is 3, 7, 1, 0.
After all new recipes are added to the scoreboard, each Elf picks a new current recipe. To do this, the Elf steps forward through the scoreboard a number of recipes equal to 1 plus the score of their current recipe. So, after the first round, the first Elf moves forward 1 + 3 = 4 times, while the second Elf moves forward 1 + 7 = 8 times. If they run out of recipes, they loop back around to the beginning. After the first round, both Elves happen to loop around until they land on the same recipe that they had in the beginning; in general, they will move to different recipes.
After all new recipes are added to the scoreboard, each Elf picks a new current recipe. To do this, the Elf steps forward through the scoreboard a number of recipes equal to 1 plus the score of their current recipe. So, after the first round, the first Elf moves forward 1 + 3 = 4 times, while the second Elf moves forward 1 + 7 = 8 times. If they run out of recipes, they loop back around to the beginning. After the first round, both Elves happen to loop around until they land on the same recipe that they had in the beginning; in general, they will move to different recipes.
Drawing the first Elf as parentheses and the second Elf as square brackets, they continue this process:
Drawing the first Elf as parentheses and the second Elf as square brackets, they continue this process:
(3)[7]
(3)[7] 1 0
(3)[7]
(3)[7] 1 0
3 7 1 [0](1) 0
3 7 1 0 [1] 0 (1)
(3) 7 1 0 1 0 [1] 2
(3) 7 1 0 1 0 [1] 2
3 7 1 0 (1) 0 1 2 [4]
3 7 1 [0] 1 0 (1) 2 4 5
3 7 1 0 [1] 0 1 2 (4) 5 1
@@ -39,36 +38,36 @@ namespace AdventOfCode2018
3 7 [1] 0 1 0 (1) 2 4 5 1 5 8 9 1 6 7 7 9
3 7 1 0 [1] 0 1 2 (4) 5 1 5 8 9 1 6 7 7 9 2
The Elves think their skill will improve after making a few recipes (your puzzle input). However, that could take ages; you can speed this up considerably by identifying the scores of the ten recipes after that. For example:
The Elves think their skill will improve after making a few recipes (your puzzle input). However, that could take ages; you can speed this up considerably by identifying the scores of the ten recipes after that. For example:
If the Elves think their skill will improve after making 9 recipes, the scores of the ten recipes after the first nine on the scoreboard would be 5158916779 (highlighted in the last line of the diagram).
After 5 recipes, the scores of the next ten would be 0124515891.
After 18 recipes, the scores of the next ten would be 9251071085.
After 2018 recipes, the scores of the next ten would be 5941429882.
What are the scores of the ten recipes immediately after the number of recipes in your puzzle input?
What are the scores of the ten recipes immediately after the number of recipes in your puzzle input?
--- Part Two ---
--- Part Two ---
As it turns out, you got the Elves' plan backwards. They actually want to know how many recipes appear on the scoreboard to the left of the first recipes whose scores are the digits from your puzzle input.
As it turns out, you got the Elves' plan backwards. They actually want to know how many recipes appear on the scoreboard to the left of the first recipes whose scores are the digits from your puzzle input.
51589 first appears after 9 recipes.
01245 first appears after 5 recipes.
92510 first appears after 18 recipes.
59414 first appears after 2018 recipes.
How many recipes appear on the scoreboard to the left of the score sequence in your puzzle input?
How many recipes appear on the scoreboard to the left of the score sequence in your puzzle input?
*/
*/
public class Day14 : IDay
{
private long _numRecipes = 0;
private long _numRecipesAllocated = 0;
private byte[] _recipes = null;
private long _idxA = 0;
private long _idxB = 0;
private long _searchSkip = 0;
public class Day14 : IDay
{
private long _numRecipes;
private long _numRecipesAllocated;
private byte[] _recipes;
private long _idxA;
private long _idxB;
private long _searchSkip;
private void Init(long hintAllocation = 128)
{
@@ -165,7 +164,7 @@ namespace AdventOfCode2018
Step();
} while (_numRecipes < (numSkipRecipes + 10));
StringBuilder sb = new StringBuilder();
StringBuilder sb = new();
for (int i = 0; i < 10; i++)
{
sb.Append(_recipes[numSkipRecipes + i]);
@@ -177,7 +176,7 @@ namespace AdventOfCode2018
{
byte[] pattern = inputs[0].Select(c => (byte)(c - '0')).ToArray();
Init();
long position = -1;
long position;
do
{
if (Show) { Print(); }
@@ -186,5 +185,4 @@ namespace AdventOfCode2018
} while (position < 0);
return position.ToString();
}
}
}

604
AdventOfCode2018/Day15.cs
View File

@@ -1,386 +1,384 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2018
{
/*
namespace AdventOfCode2018;
/*
*
--- Day 15: Beverage Bandits ---
--- Day 15: Beverage Bandits ---
Having perfected their hot chocolate, the Elves have a new problem: the Goblins that live in these caves will do anything to steal it. Looks like they're here for a fight.
Having perfected their hot chocolate, the Elves have a new problem: the Goblins that live in these caves will do anything to steal it. Looks like they're here for a fight.
You scan the area, generating a map of the walls (#), open cavern (.), and starting position of every Goblin (G) and Elf (E) (your puzzle input).
You scan the area, generating a map of the walls (#), open cavern (.), and starting position of every Goblin (G) and Elf (E) (your puzzle input).
Combat proceeds in rounds; in each round, each unit that is still alive takes a turn, resolving all of its actions before the next unit's turn begins. On each unit's turn, it tries to move into range of an enemy (if it isn't already) and then attack (if it is in range).
Combat proceeds in rounds; in each round, each unit that is still alive takes a turn, resolving all of its actions before the next unit's turn begins. On each unit's turn, it tries to move into range of an enemy (if it isn't already) and then attack (if it is in range).
All units are very disciplined and always follow very strict combat rules. Units never move or attack diagonally, as doing so would be dishonorable. When multiple choices are equally valid, ties are broken in reading order: top-to-bottom, then left-to-right. For instance, the order in which units take their turns within a round is the reading order of their starting positions in that round, regardless of the type of unit or whether other units have moved after the round started. For example:
All units are very disciplined and always follow very strict combat rules. Units never move or attack diagonally, as doing so would be dishonorable. When multiple choices are equally valid, ties are broken in reading order: top-to-bottom, then left-to-right. For instance, the order in which units take their turns within a round is the reading order of their starting positions in that round, regardless of the type of unit or whether other units have moved after the round started. For example:
would take their
These units: turns in this order:
These units: turns in this order:
####### #######
#.G.E.# #.1.2.#
#E.G.E# #3.4.5#
#.G.E.# #.6.7.#
####### #######
Each unit begins its turn by identifying all possible targets (enemy units). If no targets remain, combat ends.
Each unit begins its turn by identifying all possible targets (enemy units). If no targets remain, combat ends.
Then, the unit identifies all of the open squares (.) that are in range of each target; these are the squares which are adjacent (immediately up, down, left, or right) to any target and which aren't already occupied by a wall or another unit. Alternatively, the unit might already be in range of a target. If the unit is not already in range of a target, and there are no open squares which are in range of a target, the unit ends its turn.
Then, the unit identifies all of the open squares (.) that are in range of each target; these are the squares which are adjacent (immediately up, down, left, or right) to any target and which aren't already occupied by a wall or another unit. Alternatively, the unit might already be in range of a target. If the unit is not already in range of a target, and there are no open squares which are in range of a target, the unit ends its turn.
If the unit is already in range of a target, it does not move, but continues its turn with an attack. Otherwise, since it is not in range of a target, it moves.
If the unit is already in range of a target, it does not move, but continues its turn with an attack. Otherwise, since it is not in range of a target, it moves.
To move, the unit first considers the squares that are in range and determines which of those squares it could reach in the fewest steps. A step is a single movement to any adjacent (immediately up, down, left, or right) open (.) square. Units cannot move into walls or other units. The unit does this while considering the current positions of units and does not do any prediction about where units will be later. If the unit cannot reach (find an open path to) any of the squares that are in range, it ends its turn. If multiple squares are in range and tied for being reachable in the fewest steps, the square which is first in reading order is chosen. For example:
To move, the unit first considers the squares that are in range and determines which of those squares it could reach in the fewest steps. A step is a single movement to any adjacent (immediately up, down, left, or right) open (.) square. Units cannot move into walls or other units. The unit does this while considering the current positions of units and does not do any prediction about where units will be later. If the unit cannot reach (find an open path to) any of the squares that are in range, it ends its turn. If multiple squares are in range and tied for being reachable in the fewest steps, the square which is first in reading order is chosen. For example:
Targets: In range: Reachable: Nearest: Chosen:
####### ####### ####### ####### #######
#E..G.# #E.?G?# #E.@G.# #E.!G.# #E.+G.#
#...#.# --> #.?.#?# --> #.@.#.# --> #.!.#.# --> #...#.#
#.G.#G# #?G?#G# #@G@#G# #!G.#G# #.G.#G#
####### ####### ####### ####### #######
Targets: In range: Reachable: Nearest: Chosen:
####### ####### ####### ####### #######
#E..G.# #E.?G?# #E.@G.# #E.!G.# #E.+G.#
#...#.# --> #.?.#?# --> #.@.#.# --> #.!.#.# --> #...#.#
#.G.#G# #?G?#G# #@G@#G# #!G.#G# #.G.#G#
####### ####### ####### ####### #######
In the above scenario, the Elf has three targets (the three Goblins):
In the above scenario, the Elf has three targets (the three Goblins):
Each of the Goblins has open, adjacent squares which are in range (marked with a ? on the map).
Of those squares, four are reachable (marked @); the other two (on the right) would require moving through a wall or unit to reach.
Three of these reachable squares are nearest, requiring the fewest steps (only 2) to reach (marked !).
Of those, the square which is first in reading order is chosen (+).
The unit then takes a single step toward the chosen square along the shortest path to that square. If multiple steps would put the unit equally closer to its destination, the unit chooses the step which is first in reading order. (This requires knowing when there is more than one shortest path so that you can consider the first step of each such path.) For example:
The unit then takes a single step toward the chosen square along the shortest path to that square. If multiple steps would put the unit equally closer to its destination, the unit chooses the step which is first in reading order. (This requires knowing when there is more than one shortest path so that you can consider the first step of each such path.) For example:
In range: Nearest: Chosen: Distance: Step:
####### ####### ####### ####### #######
#.E...# #.E...# #.E...# #4E212# #..E..#
#...?.# --> #...!.# --> #...+.# --> #32101# --> #.....#
#..?G?# #..!G.# #...G.# #432G2# #...G.#
####### ####### ####### ####### #######
In range: Nearest: Chosen: Distance: Step:
####### ####### ####### ####### #######
#.E...# #.E...# #.E...# #4E212# #..E..#
#...?.# --> #...!.# --> #...+.# --> #32101# --> #.....#
#..?G?# #..!G.# #...G.# #432G2# #...G.#
####### ####### ####### ####### #######
The Elf sees three squares in range of a target (?), two of which are nearest (!), and so the first in reading order is chosen (+). Under "Distance", each open square is marked with its distance from the destination square; the two squares to which the Elf could move on this turn (down and to the right) are both equally good moves and would leave the Elf 2 steps from being in range of the Goblin. Because the step which is first in reading order is chosen, the Elf moves right one square.
The Elf sees three squares in range of a target (?), two of which are nearest (!), and so the first in reading order is chosen (+). Under "Distance", each open square is marked with its distance from the destination square; the two squares to which the Elf could move on this turn (down and to the right) are both equally good moves and would leave the Elf 2 steps from being in range of the Goblin. Because the step which is first in reading order is chosen, the Elf moves right one square.
Here's a larger example of movement:
Here's a larger example of movement:
Initially:
#########
#G..G..G#
#.......#
#.......#
#G..E..G#
#.......#
#.......#
#G..G..G#
#########
Initially:
#########
#G..G..G#
#.......#
#.......#
#G..E..G#
#.......#
#.......#
#G..G..G#
#########
After 1 round:
#########
#.G...G.#
#...G...#
#...E..G#
#.G.....#
#.......#
#G..G..G#
#.......#
#########
After 1 round:
#########
#.G...G.#
#...G...#
#...E..G#
#.G.....#
#.......#
#G..G..G#
#.......#
#########
After 2 rounds:
#########
#..G.G..#
#...G...#
#.G.E.G.#
#.......#
#G..G..G#
#.......#
#.......#
#########
After 2 rounds:
#########
#..G.G..#
#...G...#
#.G.E.G.#
#.......#
#G..G..G#
#.......#
#.......#
#########
After 3 rounds:
#########
#.......#
#..GGG..#
#..GEG..#
#G..G...#
#......G#
#.......#
#.......#
#########
After 3 rounds:
#########
#.......#
#..GGG..#
#..GEG..#
#G..G...#
#......G#
#.......#
#.......#
#########
Once the Goblins and Elf reach the positions above, they all are either in range of a target or cannot find any square in range of a target, and so none of the units can move until a unit dies.
Once the Goblins and Elf reach the positions above, they all are either in range of a target or cannot find any square in range of a target, and so none of the units can move until a unit dies.
After moving (or if the unit began its turn in range of a target), the unit attacks.
After moving (or if the unit began its turn in range of a target), the unit attacks.
To attack, the unit first determines all of the targets that are in range of it by being immediately adjacent to it. If there are no such targets, the unit ends its turn. Otherwise, the adjacent target with the fewest hit points is selected; in a tie, the adjacent target with the fewest hit points which is first in reading order is selected.
To attack, the unit first determines all of the targets that are in range of it by being immediately adjacent to it. If there are no such targets, the unit ends its turn. Otherwise, the adjacent target with the fewest hit points is selected; in a tie, the adjacent target with the fewest hit points which is first in reading order is selected.
The unit deals damage equal to its attack power to the selected target, reducing its hit points by that amount. If this reduces its hit points to 0 or fewer, the selected target dies: its square becomes . and it takes no further turns.
The unit deals damage equal to its attack power to the selected target, reducing its hit points by that amount. If this reduces its hit points to 0 or fewer, the selected target dies: its square becomes . and it takes no further turns.
Each unit, either Goblin or Elf, has 3 attack power and starts with 200 hit points.
Each unit, either Goblin or Elf, has 3 attack power and starts with 200 hit points.
For example, suppose the only Elf is about to attack:
For example, suppose the only Elf is about to attack:
HP: HP:
G.... 9 G.... 9
..G.. 4 ..G.. 4
..EG. 2 --> ..E..
..G.. 2 ..G.. 2
...G. 1 ...G. 1
G.... 9 G.... 9
..G.. 4 ..G.. 4
..EG. 2 --> ..E..
..G.. 2 ..G.. 2
...G. 1 ...G. 1
The "HP" column shows the hit points of the Goblin to the left in the corresponding row. The Elf is in range of three targets: the Goblin above it (with 4 hit points), the Goblin to its right (with 2 hit points), and the Goblin below it (also with 2 hit points). Because three targets are in range, the ones with the lowest hit points are selected: the two Goblins with 2 hit points each (one to the right of the Elf and one below the Elf). Of those, the Goblin first in reading order (the one to the right of the Elf) is selected. The selected Goblin's hit points (2) are reduced by the Elf's attack power (3), reducing its hit points to -1, killing it.
The "HP" column shows the hit points of the Goblin to the left in the corresponding row. The Elf is in range of three targets: the Goblin above it (with 4 hit points), the Goblin to its right (with 2 hit points), and the Goblin below it (also with 2 hit points). Because three targets are in range, the ones with the lowest hit points are selected: the two Goblins with 2 hit points each (one to the right of the Elf and one below the Elf). Of those, the Goblin first in reading order (the one to the right of the Elf) is selected. The selected Goblin's hit points (2) are reduced by the Elf's attack power (3), reducing its hit points to -1, killing it.
After attacking, the unit's turn ends. Regardless of how the unit's turn ends, the next unit in the round takes its turn. If all units have taken turns in this round, the round ends, and a new round begins.
After attacking, the unit's turn ends. Regardless of how the unit's turn ends, the next unit in the round takes its turn. If all units have taken turns in this round, the round ends, and a new round begins.
The Elves look quite outnumbered. You need to determine the outcome of the battle: the number of full rounds that were completed (not counting the round in which combat ends) multiplied by the sum of the hit points of all remaining units at the moment combat ends. (Combat only ends when a unit finds no targets during its turn.)
The Elves look quite outnumbered. You need to determine the outcome of the battle: the number of full rounds that were completed (not counting the round in which combat ends) multiplied by the sum of the hit points of all remaining units at the moment combat ends. (Combat only ends when a unit finds no targets during its turn.)
Below is an entire sample combat. Next to each map, each row's units' hit points are listed from left to right.
Below is an entire sample combat. Next to each map, each row's units' hit points are listed from left to right.
Initially:
#######
#.G...# G(200)
#...EG# E(200), G(200)
#.#.#G# G(200)
#..G#E# G(200), E(200)
#.....#
#######
Initially:
#######
#.G...# G(200)
#...EG# E(200), G(200)
#.#.#G# G(200)
#..G#E# G(200), E(200)
#.....#
#######
After 1 round:
#######
#..G..# G(200)
#...EG# E(197), G(197)
#.#G#G# G(200), G(197)
#...#E# E(197)
#.....#
#######
After 1 round:
#######
#..G..# G(200)
#...EG# E(197), G(197)
#.#G#G# G(200), G(197)
#...#E# E(197)
#.....#
#######
After 2 rounds:
#######
#...G.# G(200)
#..GEG# G(200), E(188), G(194)
#.#.#G# G(194)
#...#E# E(194)
#.....#
#######
After 2 rounds:
#######
#...G.# G(200)
#..GEG# G(200), E(188), G(194)
#.#.#G# G(194)
#...#E# E(194)
#.....#
#######
Combat ensues; eventually, the top Elf dies:
Combat ensues; eventually, the top Elf dies:
After 23 rounds:
#######
#...G.# G(200)
#..G.G# G(200), G(131)
#.#.#G# G(131)
#...#E# E(131)
#.....#
#######
After 23 rounds:
#######
#...G.# G(200)
#..G.G# G(200), G(131)
#.#.#G# G(131)
#...#E# E(131)
#.....#
#######
After 24 rounds:
#######
#..G..# G(200)
#...G.# G(131)
#.#G#G# G(200), G(128)
#...#E# E(128)
#.....#
#######
After 24 rounds:
#######
#..G..# G(200)
#...G.# G(131)
#.#G#G# G(200), G(128)
#...#E# E(128)
#.....#
#######
After 25 rounds:
#######
#.G...# G(200)
#..G..# G(131)
#.#.#G# G(125)
#..G#E# G(200), E(125)
#.....#
#######
After 25 rounds:
#######
#.G...# G(200)
#..G..# G(131)
#.#.#G# G(125)
#..G#E# G(200), E(125)
#.....#
#######
After 26 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(122)
#...#E# E(122)
#..G..# G(200)
#######
After 26 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(122)
#...#E# E(122)
#..G..# G(200)
#######
After 27 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(119)
#...#E# E(119)
#...G.# G(200)
#######
After 27 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(119)
#...#E# E(119)
#...G.# G(200)
#######
After 28 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(116)
#...#E# E(113)
#....G# G(200)
#######
After 28 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(116)
#...#E# E(113)
#....G# G(200)
#######
More combat ensues; eventually, the bottom Elf dies:
More combat ensues; eventually, the bottom Elf dies:
After 47 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(59)
#...#.#
#....G# G(200)
#######
After 47 rounds:
#######
#G....# G(200)
#.G...# G(131)
#.#.#G# G(59)
#...#.#
#....G# G(200)
#######
Before the 48th round can finish, the top-left Goblin finds that there are no targets remaining, and so combat ends. So, the number of full rounds that were completed is 47, and the sum of the hit points of all remaining units is 200+131+59+200 = 590. From these, the outcome of the battle is 47 * 590 = 27730.
Before the 48th round can finish, the top-left Goblin finds that there are no targets remaining, and so combat ends. So, the number of full rounds that were completed is 47, and the sum of the hit points of all remaining units is 200+131+59+200 = 590. From these, the outcome of the battle is 47 * 590 = 27730.
Here are a few example summarized combats:
Here are a few example summarized combats:
####### #######
#G..#E# #...#E# E(200)
#E#E.E# #E#...# E(197)
#G.##.# --> #.E##.# E(185)
#...#E# #E..#E# E(200), E(200)
#...E.# #.....#
####### #######
####### #######
#G..#E# #...#E# E(200)
#E#E.E# #E#...# E(197)
#G.##.# --> #.E##.# E(185)
#...#E# #E..#E# E(200), E(200)
#...E.# #.....#
####### #######
Combat ends after 37 full rounds
Elves win with 982 total hit points left
Outcome: 37 * 982 = 36334
Combat ends after 37 full rounds
Elves win with 982 total hit points left
Outcome: 37 * 982 = 36334
####### #######
#E..EG# #.E.E.# E(164), E(197)
#.#G.E# #.#E..# E(200)
#E.##E# --> #E.##.# E(98)
#G..#.# #.E.#.# E(200)
#..E#.# #...#.#
####### #######
####### #######
#E..EG# #.E.E.# E(164), E(197)
#.#G.E# #.#E..# E(200)
#E.##E# --> #E.##.# E(98)
#G..#.# #.E.#.# E(200)
#..E#.# #...#.#
####### #######
Combat ends after 46 full rounds
Elves win with 859 total hit points left
Outcome: 46 * 859 = 39514
Combat ends after 46 full rounds
Elves win with 859 total hit points left
Outcome: 46 * 859 = 39514
####### #######
#E.G#.# #G.G#.# G(200), G(98)
#.#G..# #.#G..# G(200)
#G.#.G# --> #..#..#
#G..#.# #...#G# G(95)
#...E.# #...G.# G(200)
####### #######
####### #######
#E.G#.# #G.G#.# G(200), G(98)
#.#G..# #.#G..# G(200)
#G.#.G# --> #..#..#
#G..#.# #...#G# G(95)
#...E.# #...G.# G(200)
####### #######
Combat ends after 35 full rounds
Goblins win with 793 total hit points left
Outcome: 35 * 793 = 27755
Combat ends after 35 full rounds
Goblins win with 793 total hit points left
Outcome: 35 * 793 = 27755
####### #######
#.E...# #.....#
#.#..G# #.#G..# G(200)
#.###.# --> #.###.#
#E#G#G# #.#.#.#
#...#G# #G.G#G# G(98), G(38), G(200)
####### #######
####### #######
#.E...# #.....#
#.#..G# #.#G..# G(200)
#.###.# --> #.###.#
#E#G#G# #.#.#.#
#...#G# #G.G#G# G(98), G(38), G(200)
####### #######
Combat ends after 54 full rounds
Goblins win with 536 total hit points left
Outcome: 54 * 536 = 28944
Combat ends after 54 full rounds
Goblins win with 536 total hit points left
Outcome: 54 * 536 = 28944
######### #########
#G......# #.G.....# G(137)
#.E.#...# #G.G#...# G(200), G(200)
#..##..G# #.G##...# G(200)
#...##..# --> #...##..#
#...#...# #.G.#...# G(200)
#.G...G.# #.......#
#.....G.# #.......#
######### #########
######### #########
#G......# #.G.....# G(137)
#.E.#...# #G.G#...# G(200), G(200)
#..##..G# #.G##...# G(200)
#...##..# --> #...##..#
#...#...# #.G.#...# G(200)
#.G...G.# #.......#
#.....G.# #.......#
######### #########
Combat ends after 20 full rounds
Goblins win with 937 total hit points left
Outcome: 20 * 937 = 18740
Combat ends after 20 full rounds
Goblins win with 937 total hit points left
Outcome: 20 * 937 = 18740
What is the outcome of the combat described in your puzzle input?
What is the outcome of the combat described in your puzzle input?
--- Part Two ---
--- Part Two ---
According to your calculations, the Elves are going to lose badly. Surely, you won't mess up the timeline too much if you give them just a little advanced technology, right?
According to your calculations, the Elves are going to lose badly. Surely, you won't mess up the timeline too much if you give them just a little advanced technology, right?
You need to make sure the Elves not only win, but also suffer no losses: even the death of a single Elf is unacceptable.
You need to make sure the Elves not only win, but also suffer no losses: even the death of a single Elf is unacceptable.
However, you can't go too far: larger changes will be more likely to permanently alter spacetime.
However, you can't go too far: larger changes will be more likely to permanently alter spacetime.
So, you need to find the outcome of the battle in which the Elves have the lowest integer attack power (at least 4) that allows them to win without a single death. The Goblins always have an attack power of 3.
So, you need to find the outcome of the battle in which the Elves have the lowest integer attack power (at least 4) that allows them to win without a single death. The Goblins always have an attack power of 3.
In the first summarized example above, the lowest attack power the Elves need to win without losses is 15:
In the first summarized example above, the lowest attack power the Elves need to win without losses is 15:
####### #######
#.G...# #..E..# E(158)
#...EG# #...E.# E(14)
#.#.#G# --> #.#.#.#
#..G#E# #...#.#
#.....# #.....#
####### #######
####### #######
#.G...# #..E..# E(158)
#...EG# #...E.# E(14)
#.#.#G# --> #.#.#.#
#..G#E# #...#.#
#.....# #.....#
####### #######
Combat ends after 29 full rounds
Elves win with 172 total hit points left
Outcome: 29 * 172 = 4988
Combat ends after 29 full rounds
Elves win with 172 total hit points left
Outcome: 29 * 172 = 4988
In the second example above, the Elves need only 4 attack power:
In the second example above, the Elves need only 4 attack power:
####### #######
#E..EG# #.E.E.# E(200), E(23)
#.#G.E# #.#E..# E(200)
#E.##E# --> #E.##E# E(125), E(200)
#G..#.# #.E.#.# E(200)
#..E#.# #...#.#
####### #######
####### #######
#E..EG# #.E.E.# E(200), E(23)
#.#G.E# #.#E..# E(200)
#E.##E# --> #E.##E# E(125), E(200)
#G..#.# #.E.#.# E(200)
#..E#.# #...#.#
####### #######
Combat ends after 33 full rounds
Elves win with 948 total hit points left
Outcome: 33 * 948 = 31284
Combat ends after 33 full rounds
Elves win with 948 total hit points left
Outcome: 33 * 948 = 31284
In the third example above, the Elves need 15 attack power:
In the third example above, the Elves need 15 attack power:
####### #######
#E.G#.# #.E.#.# E(8)
#.#G..# #.#E..# E(86)
#G.#.G# --> #..#..#
#G..#.# #...#.#
#...E.# #.....#
####### #######
####### #######
#E.G#.# #.E.#.# E(8)
#.#G..# #.#E..# E(86)
#G.#.G# --> #..#..#
#G..#.# #...#.#
#...E.# #.....#
####### #######
Combat ends after 37 full rounds
Elves win with 94 total hit points left
Outcome: 37 * 94 = 3478
Combat ends after 37 full rounds
Elves win with 94 total hit points left
Outcome: 37 * 94 = 3478
In the fourth example above, the Elves need 12 attack power:
In the fourth example above, the Elves need 12 attack power:
####### #######
#.E...# #...E.# E(14)
#.#..G# #.#..E# E(152)
#.###.# --> #.###.#
#E#G#G# #.#.#.#
#...#G# #...#.#
####### #######
####### #######
#.E...# #...E.# E(14)
#.#..G# #.#..E# E(152)
#.###.# --> #.###.#
#E#G#G# #.#.#.#
#...#G# #...#.#
####### #######
Combat ends after 39 full rounds
Elves win with 166 total hit points left
Outcome: 39 * 166 = 6474
Combat ends after 39 full rounds
Elves win with 166 total hit points left
Outcome: 39 * 166 = 6474
In the last example above, the lone Elf needs 34 attack power:
In the last example above, the lone Elf needs 34 attack power:
######### #########
#G......# #.......#
#.E.#...# #.E.#...# E(38)
#..##..G# #..##...#
#...##..# --> #...##..#
#...#...# #...#...#
#.G...G.# #.......#
#.....G.# #.......#
######### #########
######### #########
#G......# #.......#
#.E.#...# #.E.#...# E(38)
#..##..G# #..##...#
#...##..# --> #...##..#
#...#...# #...#...#
#.G...G.# #.......#
#.....G.# #.......#
######### #########
Combat ends after 30 full rounds
Elves win with 38 total hit points left
Outcome: 30 * 38 = 1140
Combat ends after 30 full rounds
Elves win with 38 total hit points left
Outcome: 30 * 38 = 1140
After increasing the Elves' attack power until it is just barely enough for them to win without any Elves dying, what is the outcome of the combat described in your puzzle input?
After increasing the Elves' attack power until it is just barely enough for them to win without any Elves dying, what is the outcome of the combat described in your puzzle input?
*/
public class Day15 : IDay
{
*/
public class Day15 : IDay
{
public enum EntityType { Elf, Goblin, }
public bool Show { get; set; } = false;
@@ -450,12 +448,12 @@ namespace AdventOfCode2018
public Entity Entity { get; set; }
}
private int _width = 0;
private int _height = 0;
private char[,] _map = null;
private List<Entity> _entities = null;
private BreadthFirstSearchGrid _search = null;
private int _rounds = 0;
private int _width;
private int _height;
private char[,] _map;
private List<Entity> _entities;
private BreadthFirstSearchGrid _search;
private int _rounds;
private void Init(string[] inputs)
{
@@ -575,7 +573,7 @@ namespace AdventOfCode2018
// Move
_search.SearchCharGrid(_map, '.', entity.X, entity.Y);
List<Target> targets = new List<Target>();
List<Target> targets = new();
int priority = 0;
foreach (Entity entityTarget in entitiesTargets)
{
@@ -623,7 +621,6 @@ namespace AdventOfCode2018
if (targetInRangeAfterMove != null)
{
entity.Attack(_map, targetInRangeAfterMove);
continue;
}
}
}
@@ -689,16 +686,16 @@ namespace AdventOfCode2018
{
private class BFSCell
{
public bool Visited { get; set; } =false;
public BFSCell CameFrom { get; set; } = null;
public bool Visited { get; set; }
public BFSCell CameFrom { get; set; }
public int Distance { get; set; } = -1;
public int X { get; set; }
public int Y { get; set; }
}
private readonly BFSCell[,] _grid= null;
private readonly int _width = 0;
private readonly int _height = 0;
private readonly BFSCell[,] _grid;
private readonly int _width;
private readonly int _height;
public BreadthFirstSearchGrid(int width, int height)
{
@@ -747,7 +744,7 @@ namespace AdventOfCode2018
public void SearchCharGrid(char[,] grid, char empty, int x, int y)
{
Reset();
Queue<BFSCell> frontier = new Queue<BFSCell>();
Queue<BFSCell> frontier = new();
ProcessCell(grid, empty, frontier, null, x, y);
while (frontier.Any())
{
@@ -766,5 +763,4 @@ namespace AdventOfCode2018
return cell.Distance;
}
}
}
}

83
AdventOfCode2018/Day23.cs
View File

@@ -1,39 +1,36 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2018
{
/*
--- Day 23: Experimental Emergency Teleportation ---
namespace AdventOfCode2018;
/*
--- Day 23: Experimental Emergency Teleportation ---
Using your torch to search the darkness of the rocky cavern, you finally locate the man's friend: a small reindeer.
Using your torch to search the darkness of the rocky cavern, you finally locate the man's friend: a small reindeer.
You're not sure how it got so far in this cave. It looks sick - too sick to walk - and too heavy for you to carry all the way back. Sleighs won't be invented for another 1500 years, of course.
You're not sure how it got so far in this cave. It looks sick - too sick to walk - and too heavy for you to carry all the way back. Sleighs won't be invented for another 1500 years, of course.
The only option is experimental emergency teleportation.
The only option is experimental emergency teleportation.
You hit the "experimental emergency teleportation" button on the device and push I accept the risk on no fewer than 18 different warning messages. Immediately, the device deploys hundreds of tiny nanobots which fly around the cavern, apparently assembling themselves into a very specific formation. The device lists the X,Y,Z position (pos) for each nanobot as well as its signal radius (r) on its tiny screen (your puzzle input).
You hit the "experimental emergency teleportation" button on the device and push I accept the risk on no fewer than 18 different warning messages. Immediately, the device deploys hundreds of tiny nanobots which fly around the cavern, apparently assembling themselves into a very specific formation. The device lists the X,Y,Z position (pos) for each nanobot as well as its signal radius (r) on its tiny screen (your puzzle input).
Each nanobot can transmit signals to any integer coordinate which is a distance away from it less than or equal to its signal radius (as measured by Manhattan distance). Coordinates a distance away of less than or equal to a nanobot's signal radius are said to be in range of that nanobot.
Each nanobot can transmit signals to any integer coordinate which is a distance away from it less than or equal to its signal radius (as measured by Manhattan distance). Coordinates a distance away of less than or equal to a nanobot's signal radius are said to be in range of that nanobot.
Before you start the teleportation process, you should determine which nanobot is the strongest (that is, which has the largest signal radius) and then, for that nanobot, the total number of nanobots that are in range of it, including itself.
Before you start the teleportation process, you should determine which nanobot is the strongest (that is, which has the largest signal radius) and then, for that nanobot, the total number of nanobots that are in range of it, including itself.
For example, given the following nanobots:
For example, given the following nanobots:
pos=<0,0,0>, r=4
pos=<1,0,0>, r=1
pos=<4,0,0>, r=3
pos=<0,2,0>, r=1
pos=<0,5,0>, r=3
pos=<0,0,3>, r=1
pos=<1,1,1>, r=1
pos=<1,1,2>, r=1
pos=<1,3,1>, r=1
pos=<0,0,0>, r=4
pos=<1,0,0>, r=1
pos=<4,0,0>, r=3
pos=<0,2,0>, r=1
pos=<0,5,0>, r=3
pos=<0,0,3>, r=1
pos=<1,1,1>, r=1
pos=<1,1,2>, r=1
pos=<1,3,1>, r=1
The strongest nanobot is the first one (position 0,0,0) because its signal radius, 4 is the largest. Using that nanobot's location and signal radius, the following nanobots are in or out of range:
The strongest nanobot is the first one (position 0,0,0) because its signal radius, 4 is the largest. Using that nanobot's location and signal radius, the following nanobots are in or out of range:
The nanobot at 0,0,0 is distance 0 away, and so it is in range.
The nanobot at 1,0,0 is distance 1 away, and so it is in range.
@@ -45,33 +42,33 @@ namespace AdventOfCode2018
The nanobot at 1,1,2 is distance 4 away, and so it is in range.
The nanobot at 1,3,1 is distance 5 away, and so it is not in range.
In this example, in total, 7 nanobots are in range of the nanobot with the largest signal radius.
In this example, in total, 7 nanobots are in range of the nanobot with the largest signal radius.
Find the nanobot with the largest signal radius. How many nanobots are in range of its signals?
Find the nanobot with the largest signal radius. How many nanobots are in range of its signals?
--- Part Two ---
--- Part Two ---
Now, you just need to figure out where to position yourself so that you're actually teleported when the nanobots activate.
Now, you just need to figure out where to position yourself so that you're actually teleported when the nanobots activate.
To increase the probability of success, you need to find the coordinate which puts you in range of the largest number of nanobots. If there are multiple, choose one closest to your position (0,0,0, measured by manhattan distance).
To increase the probability of success, you need to find the coordinate which puts you in range of the largest number of nanobots. If there are multiple, choose one closest to your position (0,0,0, measured by manhattan distance).
For example, given the following nanobot formation:
For example, given the following nanobot formation:
pos=<10,12,12>, r=2
pos=<12,14,12>, r=2
pos=<16,12,12>, r=4
pos=<14,14,14>, r=6
pos=<50,50,50>, r=200
pos=<10,10,10>, r=5
pos=<10,12,12>, r=2
pos=<12,14,12>, r=2
pos=<16,12,12>, r=4
pos=<14,14,14>, r=6
pos=<50,50,50>, r=200
pos=<10,10,10>, r=5
Many coordinates are in range of some of the nanobots in this formation. However, only the coordinate 12,12,12 is in range of the most nanobots: it is in range of the first five, but is not in range of the nanobot at 10,10,10. (All other coordinates are in range of fewer than five nanobots.) This coordinate's distance from 0,0,0 is 36.
Many coordinates are in range of some of the nanobots in this formation. However, only the coordinate 12,12,12 is in range of the most nanobots: it is in range of the first five, but is not in range of the nanobot at 10,10,10. (All other coordinates are in range of fewer than five nanobots.) This coordinate's distance from 0,0,0 is 36.
Find the coordinates that are in range of the largest number of nanobots. What is the shortest manhattan distance between any of those points and 0,0,0?
Find the coordinates that are in range of the largest number of nanobots. What is the shortest manhattan distance between any of those points and 0,0,0?
*/
*/
public class Day23 : IDay
{
public class Day23 : IDay
{
public string ResolvePart1(string[] inputs)
{
List<NanoBot> nanoBots = NanoBot.ListFromStrings(inputs);
@@ -159,10 +156,9 @@ namespace AdventOfCode2018
public static NanoBot FromString(string strInput)
{
string[] parts = strInput.Split(new string[] { "pos=<", ",", ">, r=", }, StringSplitOptions.RemoveEmptyEntries);
string[] parts = strInput.Split(new[] { "pos=<", ",", ">, r=", }, StringSplitOptions.RemoveEmptyEntries);
if (parts.Length != 4) { return null; }
NanoBot nanoBot = new NanoBot
{
NanoBot nanoBot = new() {
X = Convert.ToInt64(parts[0]),
Y = Convert.ToInt64(parts[1]),
Z = Convert.ToInt64(parts[2]),
@@ -204,5 +200,4 @@ namespace AdventOfCode2018
return distance <= range;
}
}
}
}

7
AdventOfCode2018/IDay.cs
View File

@@ -1,8 +1,7 @@
namespace AdventOfCode2018
namespace AdventOfCode2018;
public interface IDay
{
public interface IDay
{
string ResolvePart1(string[] inputs);
string ResolvePart2(string[] inputs);
}
}

11
AdventOfCode2018/Program.cs
View File

@@ -1,11 +1,11 @@
using System;
using System.IO;
namespace AdventOfCode2018
namespace AdventOfCode2018;
internal class Program
{
internal class Program
{
private static void Main(string[] args)
private static void Main()
{
int currentDayNumber = 15;
IDay currentDay = null;
@@ -30,7 +30,7 @@ namespace AdventOfCode2018
case 23: currentDay = new Day23(); break;
}
string[] linesDay = File.ReadAllLines(string.Format("inputs/Day{0:00}.txt", currentDayNumber));
string[] linesDay = File.ReadAllLines($"inputs/Day{currentDayNumber:00}.txt");
string resultPart1 = currentDay.ResolvePart1(linesDay);
Console.WriteLine("Day{1:00} Result Part1: {0}", resultPart1, currentDayNumber);
string resultPart2 = currentDay.ResolvePart2(linesDay);
@@ -38,5 +38,4 @@ namespace AdventOfCode2018
Console.Read();
}
}
}

11
AdventOfCode2020.Tests/Day01_Tests.cs
View File

@@ -1,9 +1,7 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day01_Tests
{
public class Day01_Tests
{
#region ResolvePart1
[Fact]
@@ -11,7 +9,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day01();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"1721",
"979",
"366",
@@ -32,7 +30,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day01();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"1721",
"979",
"366",
@@ -45,5 +43,4 @@ namespace AdventOfCode2020.Tests
}
#endregion ResolvePart2
}
}

11
AdventOfCode2020.Tests/Day02_Tests.cs
View File

@@ -1,9 +1,7 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day02_Tests
{
public class Day02_Tests
{
#region ResolvePart1
[Fact]
@@ -11,7 +9,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day02();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"1-3 a: abcde",
"1-3 b: cdefg",
"2-9 c: ccccccccc",
@@ -29,7 +27,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day02();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"1-3 a: abcde",
"1-3 b: cdefg",
"2-9 c: ccccccccc",
@@ -39,5 +37,4 @@ namespace AdventOfCode2020.Tests
}
#endregion ResolvePart1
}
}

11
AdventOfCode2020.Tests/Day03_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day03_Tests
{
public class Day03_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day03();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"..##.......",
"#...#...#..",
".#....#..#.",
@@ -31,7 +29,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day03();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"..##.......",
"#...#...#..",
".#....#..#.",
@@ -47,5 +45,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("336", result);
}
}
}

13
AdventOfCode2020.Tests/Day04_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day04_Tests
{
public class Day04_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day04();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"ecl:gry pid:860033327 eyr:2020 hcl:#fffffd",
"byr:1937 iyr:2017 cid:147 hgt:183cm",
"",
@@ -33,7 +31,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day04();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"eyr:1972 cid:100",
"hcl:#18171d ecl:amb hgt:170 pid:186cm iyr:2018 byr:1926",
"",
@@ -57,7 +55,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day04();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"pid:087499704 hgt:74in ecl:grn iyr:2012 eyr:2030 byr:1980",
"hcl:#623a2f",
"",
@@ -74,5 +72,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("4", result);
}
}
}

15
AdventOfCode2020.Tests/Day05_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day05_Tests
{
public class Day05_Tests
{
[Fact]
public void ResolvePart1__Example1()
{
var day = new Day05();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"FBFBBFFRLR",
});
@@ -21,7 +19,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day05();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"BFFFBBFRRR",
});
@@ -33,7 +31,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day05();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"FFFBBBFRRR",
});
@@ -45,11 +43,10 @@ namespace AdventOfCode2020.Tests
{
var day = new Day05();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"BBFFBBFRLL",
});
Assert.Equal("820", result);
}
}
}

11
AdventOfCode2020.Tests/Day06_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day06_Tests
{
public class Day06_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day06();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"abc",
"",
"a",
@@ -35,7 +33,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day06();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"abc",
"",
"a",
@@ -55,5 +53,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("6", result);
}
}
}

11
AdventOfCode2020.Tests/Day07_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day07_Tests
{
public class Day07_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day07();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"light red bags contain 1 bright white bag, 2 muted yellow bags.",
"dark orange bags contain 3 bright white bags, 4 muted yellow bags.",
"bright white bags contain 1 shiny gold bag.",
@@ -29,7 +27,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day07();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"shiny gold bags contain 2 dark red bags.",
"dark red bags contain 2 dark orange bags.",
"dark orange bags contain 2 dark yellow bags.",
@@ -41,5 +39,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("126", result);
}
}
}

11
AdventOfCode2020.Tests/Day08_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day08_Tests
{
public class Day08_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day08();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"nop +0",
"acc +1",
"jmp +4",
@@ -29,7 +27,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day08();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"nop +0",
"acc +1",
"jmp +4",
@@ -43,5 +41,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("8", result);
}
}
}

11
AdventOfCode2020.Tests/Day09_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day09_Tests
{
public class Day09_Tests
{
[Fact]
public void ResolvePart1__Example()
{
var day = new Day09();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"35",
"20",
"15",
@@ -40,7 +38,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day09();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"35",
"20",
"15",
@@ -65,5 +63,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("62", result);
}
}
}

11
AdventOfCode2020.Tests/Day10_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day10_Tests
{
public class Day10_Tests
{
[Fact(Skip="Not implemented")]
public void ResolvePart1__Example()
{
var day = new Day10();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
@@ -28,7 +26,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day09();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
@@ -41,5 +39,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("YYY", result);
}
}
}

11
AdventOfCode2020.Tests/Day11_Tests.cs
View File

@@ -1,15 +1,13 @@
using Xunit;
namespace AdventOfCode2020.Tests;
namespace AdventOfCode2020.Tests
public class Day11_Tests
{
public class Day11_Tests
{
[Fact(Skip="Not implemented")]
public void ResolvePart1__Example()
{
var day = new Day11();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
@@ -28,7 +26,7 @@ namespace AdventOfCode2020.Tests
{
var day = new Day11();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
"XXXXXXXXXXXXXXX",
@@ -41,5 +39,4 @@ namespace AdventOfCode2020.Tests
Assert.Equal("YYY", result);
}
}
}

1
AdventOfCode2020.Tests/Usings.cs Normal file
View File

@@ -0,0 +1 @@
global using Xunit;

13
AdventOfCode2020/Day01.cs
View File

@@ -1,8 +1,8 @@
using System;
namespace AdventOfCode2020
{
/*
namespace AdventOfCode2020;
/*
--- Day 1: Report Repair ---
After saving Christmas five years in a row, you've decided to take a vacation at a nice resort on a tropical island. Surely, Christmas will go on without you.
@@ -41,9 +41,9 @@ In your expense report, what is the product of the three entries that sum to 202
*/
public class Day01 : IDay
{
*/
public class Day01 : IDay
{
public string ResolvePart1(string[] inputs)
{
int result = -1;
@@ -85,5 +85,4 @@ In your expense report, what is the product of the three entries that sum to 202
}
return result.ToString();
}
}
}

18
AdventOfCode2020/Day02.cs
View File

@@ -1,9 +1,8 @@
using System;
using System.Linq;
namespace AdventOfCode2020
{
/*
namespace AdventOfCode2020;
/*
--- Day 2: Password Philosophy ---
Your flight departs in a few days from the coastal airport; the easiest way down to the coast from here is via toboggan.
@@ -36,18 +35,18 @@ Each policy actually describes two positions in the password, where 1 means the
Given the same example list from above:
1-3 a: abcde is valid: position 1 contains a and position 3 does not.
1-3 b: cdefg is invalid: neither position 1 nor position 3 contains b.
2-9 c: ccccccccc is invalid: both position 2 and position 9 contain c.
1-3 a: abcde is valid: position 1 contains a and position 3 does not.
1-3 b: cdefg is invalid: neither position 1 nor position 3 contains b.
2-9 c: ccccccccc is invalid: both position 2 and position 9 contain c.
How many passwords are valid according to the new interpretation of the policies?
*/
*/
public class Day02 : IDay
{
public class Day02 : IDay
{
public string ResolvePart1(string[] inputs)
{
int cntValid = 0;
@@ -88,5 +87,4 @@ How many passwords are valid according to the new interpretation of the policies
return cntValid.ToString();
}
}
}

7
AdventOfCode2020/Day03.cs
View File

@@ -74,10 +74,10 @@ What do you get if you multiply together the number of trees encountered on each
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day03 : IDay
{
public class Day03 : IDay
{
public string ResolvePart1(string[] inputs)
{
int treeCnt = FollowSlope(inputs, 3, 1);
@@ -113,5 +113,4 @@ namespace AdventOfCode2020
return treeCnt;
}
}
}

14
AdventOfCode2020/Day04.cs
View File

@@ -124,16 +124,15 @@ Count the number of valid passports - those that have all required fields and va
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day04 : IDay
{
public class Day04 : IDay
{
public string ResolvePart1(string[] inputs)
{
List<Dictionary<string, string>> passports = Passports_Parse(inputs);
int cnt = 0;
List<string> neededFields = new List<string>
{
List<string> neededFields = new() {
"byr", // Birth Year
"iyr", // Issue Year
"eyr", // Expiration Year
@@ -173,8 +172,8 @@ namespace AdventOfCode2020
private List<Dictionary<string, string>> Passports_Parse(string[] inputs)
{
List<Dictionary<string, string>> passports = new List<Dictionary<string, string>>();
Dictionary<string, string> passport = new Dictionary<string, string>();
List<Dictionary<string, string>> passports = new();
Dictionary<string, string> passport = new();
foreach (string input in inputs)
{
if (string.IsNullOrEmpty(input))
@@ -264,5 +263,4 @@ namespace AdventOfCode2020
return Convert.ToInt32(input);
}
}
}

15
AdventOfCode2020/Day05.cs
View File

@@ -59,10 +59,10 @@ What is the ID of your seat?
using System;
using System.Linq;
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day05 : IDay
{
public class Day05 : IDay
{
public string ResolvePart1(string[] inputs)
{
int maxSerialNumber = 0;
@@ -130,7 +130,7 @@ namespace AdventOfCode2020
}
if (neighbourCount == 8)
{
Seat mySeat = new Seat { Row = j, Column = i, };
Seat mySeat = new() { Row = j, Column = i, };
mySeatSerialNumber = mySeat.GetSerialNumber();
}
}
@@ -178,9 +178,9 @@ namespace AdventOfCode2020
{
return null;
}
Seat seat = new Seat();
Seat seat = new();
Range row = new Range { Start = 0, End = 127, };
Range row = new() { Start = 0, End = 127, };
for (int i = 0; i < 7; i++)
{
if (input[i] == 'F')
@@ -194,7 +194,7 @@ namespace AdventOfCode2020
}
seat.Row = row.Start;
Range column = new Range { Start = 0, End = 7, };
Range column = new() { Start = 0, End = 7, };
for (int i = 7; i < 10; i++)
{
if (input[i] == 'L')
@@ -210,5 +210,4 @@ namespace AdventOfCode2020
return seat;
}
}
}

15
AdventOfCode2020/Day06.cs
View File

@@ -52,14 +52,14 @@ For each group, count the number of questions to which anyone answered "yes". Wh
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day06 : IDay
{
public class Day06 : IDay
{
public string ResolvePart1(string[] inputs)
{
Dictionary<char, bool> groupMap = new Dictionary<char, bool>();
List<Dictionary<char, bool>> groupMaps = new List<Dictionary<char, bool>>();
Dictionary<char, bool> groupMap = new();
List<Dictionary<char, bool>> groupMaps = new();
foreach (string input in inputs)
{
if (string.IsNullOrEmpty(input) && groupMap.Count > 0)
@@ -90,8 +90,8 @@ namespace AdventOfCode2020
public string ResolvePart2(string[] inputs)
{
int groupCount = 0;
Dictionary<char, int> groupMap = new Dictionary<char, int>();
List<Tuple<int, Dictionary<char, int>>> groupMaps = new List<Tuple<int, Dictionary<char, int>>>();
Dictionary<char, int> groupMap = new();
List<Tuple<int, Dictionary<char, int>>> groupMaps = new();
foreach (string input in inputs)
{
if (string.IsNullOrEmpty(input) && groupCount > 0)
@@ -126,5 +126,4 @@ namespace AdventOfCode2020
});
return total.ToString();
}
}
}

17
AdventOfCode2020/Day07.cs
View File

@@ -68,23 +68,23 @@ How many individual bags are required inside your single shiny gold bag?
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day07 : IDay
{
public class Day07 : IDay
{
public string ResolvePart1(string[] inputs)
{
string myBagColor = "shiny gold";
List<BaggageRule> rules = new List<BaggageRule>();
List<BaggageRule> rules = new();
foreach (string input in inputs)
{
BaggageRule rule = BaggageRule_Parse(input);
rules.Add(rule);
}
List<string> bagColorsToCheck = new List<string> { myBagColor };
List<string> bagColorsChecked = new List<string> { myBagColor };
List<string> bagColorsToCheck = new() { myBagColor };
List<string> bagColorsChecked = new() { myBagColor };
int cntBagColors = 0;
while (bagColorsToCheck.Count > 0)
{
@@ -112,7 +112,7 @@ namespace AdventOfCode2020
{
string myBagColor = "shiny gold";
List<BaggageRule> rules = new List<BaggageRule>();
List<BaggageRule> rules = new();
foreach (string input in inputs)
{
BaggageRule rule = BaggageRule_Parse(input);
@@ -142,7 +142,7 @@ namespace AdventOfCode2020
{
string[] words = input.Split(' ');
string status = "Parse Color 1";
BaggageRule rule = new BaggageRule();
BaggageRule rule = new();
rule.Contain = new List<BaggageContainRule>();
BaggageContainRule containRule = null;
string color1 = string.Empty;
@@ -203,5 +203,4 @@ namespace AdventOfCode2020
}
return cnt;
}
}
}

15
AdventOfCode2020/Day08.cs
View File

@@ -93,20 +93,20 @@ Fix the program so that it terminates normally by changing exactly one jmp (to n
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day08 : IDay
{
public class Day08 : IDay
{
public string ResolvePart1(string[] inputs)
{
VM vm = new VM(inputs);
VM vm = new(inputs);
vm.Run();
return vm.Accumulator.ToString();
}
public string ResolvePart2(string[] inputs)
{
VM vm = new VM(inputs);
VM vm = new(inputs);
foreach (Instruction instruction in vm.Instructions)
{
if (instruction.OpCode == OpCode.Acc) { continue; }
@@ -133,7 +133,7 @@ namespace AdventOfCode2020
Acc,
Jmp,
Nop,
};
}
public class Instruction
{
@@ -170,7 +170,7 @@ namespace AdventOfCode2020
}
}
public class VM
private class VM
{
public List<Instruction> Instructions { get; set; }
@@ -225,5 +225,4 @@ namespace AdventOfCode2020
}
}
}
}
}

7
AdventOfCode2020/Day09.cs
View File

@@ -91,10 +91,10 @@ What is the encryption weakness in your XMAS-encrypted list of numbers?
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day09 : IDay
{
public class Day09 : IDay
{
public string ResolvePart1(string[] inputs)
{
int preamble = 25;
@@ -169,5 +169,4 @@ namespace AdventOfCode2020
return firstInvalid;
}
}
}

7
AdventOfCode2020/Day10.cs
View File

@@ -91,10 +91,10 @@ Find a chain that uses all of your adapters to connect the charging outlet to yo
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day10 : IDay
{
public class Day10 : IDay
{
public string ResolvePart1(string[] inputs)
{
throw new NotImplementedException();
@@ -104,5 +104,4 @@ namespace AdventOfCode2020
{
throw new NotImplementedException();
}
}
}

7
AdventOfCode2020/Day11.cs
View File

@@ -7,10 +7,10 @@
*/
namespace AdventOfCode2020
namespace AdventOfCode2020;
public class Day11 : IDay
{
public class Day11 : IDay
{
public string ResolvePart1(string[] inputs)
{
throw new NotImplementedException();
@@ -20,5 +20,4 @@ namespace AdventOfCode2020
{
throw new NotImplementedException();
}
}
}

7
AdventOfCode2020/IDay.cs
View File

@@ -1,8 +1,7 @@
namespace AdventOfCode2020
namespace AdventOfCode2020;
public interface IDay
{
public interface IDay
{
string ResolvePart1(string[] inputs);
string ResolvePart2(string[] inputs);
}
}

15
AdventOfCode2020/Program.cs
View File

@@ -1,11 +1,11 @@
using System;
using System.IO;
namespace AdventOfCode2020
namespace AdventOfCode2020;
class Program
{
class Program
{
static void Main(string[] args)
static void Main()
{
int currentDayNumber = 0;
@@ -22,12 +22,12 @@ namespace AdventOfCode2020
public static void RunDay(int currentDayNumber)
{
Console.WriteLine(string.Format("Day {0:00}", currentDayNumber));
Console.WriteLine($"Day {currentDayNumber:00}");
Console.WriteLine("------");
Console.WriteLine();
IDay currentDay = null;
Type dayType = Type.GetType(string.Format("AdventOfCode2020.Day{0:00}", currentDayNumber));
Type dayType = Type.GetType($"AdventOfCode2020.Day{currentDayNumber:00}");
if (dayType != null)
{
currentDay = Activator.CreateInstance(dayType) as IDay;
@@ -39,7 +39,7 @@ namespace AdventOfCode2020
return;
}
string[] linesDay = File.ReadAllLines(string.Format("inputs/Day{0:00}.txt", currentDayNumber));
string[] linesDay = File.ReadAllLines($"inputs/Day{currentDayNumber:00}.txt");
try
{
string resultPart1 = currentDay.ResolvePart1(linesDay);
@@ -62,5 +62,4 @@ namespace AdventOfCode2020
Console.WriteLine(ex.StackTrace);
}
}
}
}

4
AdventOfCode2023.Tests/Day01_Tests.cs
View File

@@ -7,7 +7,7 @@ public class Day01_Tests
{
var day = new Day01();
string result = day.ResolvePart1(new string[] {
string result = day.ResolvePart1(new[] {
"1abc2",
"pqr3stu8vwx",
"a1b2c3d4e5f",
@@ -22,7 +22,7 @@ public class Day01_Tests
{
var day = new Day01();
string result = day.ResolvePart2(new string[] {
string result = day.ResolvePart2(new[] {
"two1nine",
"eightwothree",
"abcone2threexyz",

3
AdventOfCode2023/Day01.cs
View File

@@ -78,8 +78,7 @@ public class Day01 : IDay
public string ResolvePart2(string[] inputs)
{
List<(string Text, int Value)> digits = new List<(string Text, int Value)>
{
List<(string Text, int Value)> digits = new() {
("1", 1),
("2", 2),
("3", 3),