Day02
This commit is contained in:
44
AdventOfCode2020.Tests/Day02_Tests.cs
Normal file
44
AdventOfCode2020.Tests/Day02_Tests.cs
Normal file
@@ -0,0 +1,44 @@
|
|||||||
|
using Microsoft.VisualStudio.TestTools.UnitTesting;
|
||||||
|
|
||||||
|
namespace AdventOfCode2020.Tests
|
||||||
|
{
|
||||||
|
[TestClass()]
|
||||||
|
public class Day02_Tests
|
||||||
|
{
|
||||||
|
#region ResolvePart1
|
||||||
|
|
||||||
|
[TestMethod()]
|
||||||
|
public void ResolvePart1__Example()
|
||||||
|
{
|
||||||
|
IDay day02 = new Day02();
|
||||||
|
|
||||||
|
string result = day02.ResolvePart1(new string[] {
|
||||||
|
"1-3 a: abcde",
|
||||||
|
"1-3 b: cdefg",
|
||||||
|
"2-9 c: ccccccccc",
|
||||||
|
});
|
||||||
|
|
||||||
|
Assert.AreEqual("2", result);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion ResolvePart1
|
||||||
|
|
||||||
|
#region ResolvePart2
|
||||||
|
|
||||||
|
[TestMethod()]
|
||||||
|
public void ResolvePart2__Example()
|
||||||
|
{
|
||||||
|
IDay day02 = new Day02();
|
||||||
|
|
||||||
|
string result = day02.ResolvePart2(new string[] {
|
||||||
|
"1-3 a: abcde",
|
||||||
|
"1-3 b: cdefg",
|
||||||
|
"2-9 c: ccccccccc",
|
||||||
|
});
|
||||||
|
|
||||||
|
Assert.AreEqual("1", result);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endregion ResolvePart1
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -6,7 +6,7 @@
|
|||||||
</PropertyGroup>
|
</PropertyGroup>
|
||||||
|
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<None Update="inputs\Day01.txt">
|
<None Update="inputs\*">
|
||||||
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
|
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
|
||||||
</None>
|
</None>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
|
|||||||
92
AdventOfCode2020/Day02.cs
Normal file
92
AdventOfCode2020/Day02.cs
Normal file
@@ -0,0 +1,92 @@
|
|||||||
|
using System;
|
||||||
|
using System.Linq;
|
||||||
|
|
||||||
|
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.
|
||||||
|
|
||||||
|
The shopkeeper at the North Pole Toboggan Rental Shop is having a bad day. "Something's wrong with our computers; we can't log in!" You ask if you can take a look.
|
||||||
|
|
||||||
|
Their password database seems to be a little corrupted: some of the passwords wouldn't have been allowed by the Official Toboggan Corporate Policy that was in effect when they were chosen.
|
||||||
|
|
||||||
|
To try to debug the problem, they have created a list (your puzzle input) of passwords (according to the corrupted database) and the corporate policy when that password was set.
|
||||||
|
|
||||||
|
For example, suppose you have the following list:
|
||||||
|
|
||||||
|
1-3 a: abcde
|
||||||
|
1-3 b: cdefg
|
||||||
|
2-9 c: ccccccccc
|
||||||
|
|
||||||
|
Each line gives the password policy and then the password. The password policy indicates the lowest and highest number of times a given letter must appear for the password to be valid. For example, 1-3 a means that the password must contain a at least 1 time and at most 3 times.
|
||||||
|
|
||||||
|
In the above example, 2 passwords are valid. The middle password, cdefg, is not; it contains no instances of b, but needs at least 1. The first and third passwords are valid: they contain one a or nine c, both within the limits of their respective policies.
|
||||||
|
|
||||||
|
How many passwords are valid according to their policies?
|
||||||
|
|
||||||
|
--- Part Two ---
|
||||||
|
|
||||||
|
While it appears you validated the passwords correctly, they don't seem to be what the Official Toboggan Corporate Authentication System is expecting.
|
||||||
|
|
||||||
|
The shopkeeper suddenly realizes that he just accidentally explained the password policy rules from his old job at the sled rental place down the street! The Official Toboggan Corporate Policy actually works a little differently.
|
||||||
|
|
||||||
|
Each policy actually describes two positions in the password, where 1 means the first character, 2 means the second character, and so on. (Be careful; Toboggan Corporate Policies have no concept of "index zero"!) Exactly one of these positions must contain the given letter. Other occurrences of the letter are irrelevant for the purposes of policy enforcement.
|
||||||
|
|
||||||
|
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.
|
||||||
|
|
||||||
|
How many passwords are valid according to the new interpretation of the policies?
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
public class Day02 : IDay
|
||||||
|
{
|
||||||
|
public string ResolvePart1(string[] inputs)
|
||||||
|
{
|
||||||
|
int cntValid = 0;
|
||||||
|
|
||||||
|
foreach (string input in inputs)
|
||||||
|
{
|
||||||
|
if (string.IsNullOrEmpty(input)) { continue; }
|
||||||
|
string[] parts = input.Split('-', ' ', ':');
|
||||||
|
int min = Convert.ToInt32(parts[0]);
|
||||||
|
int max = Convert.ToInt32(parts[1]);
|
||||||
|
string character = parts[2];
|
||||||
|
string password = parts[4];
|
||||||
|
int cnt = password.Count(c => c == character[0]);
|
||||||
|
if (cnt <= max && cnt >= min) { cntValid++; }
|
||||||
|
}
|
||||||
|
|
||||||
|
return cntValid.ToString();
|
||||||
|
}
|
||||||
|
|
||||||
|
public string ResolvePart2(string[] inputs)
|
||||||
|
{
|
||||||
|
int cntValid = 0;
|
||||||
|
|
||||||
|
foreach (string input in inputs)
|
||||||
|
{
|
||||||
|
if (string.IsNullOrEmpty(input)) { continue; }
|
||||||
|
string[] parts = input.Split('-', ' ', ':');
|
||||||
|
int index0 = Convert.ToInt32(parts[0]);
|
||||||
|
int index1 = Convert.ToInt32(parts[1]);
|
||||||
|
string character = parts[2];
|
||||||
|
string password = parts[4];
|
||||||
|
if (password.Length < index0 || password.Length < index1) { continue; }
|
||||||
|
bool hasIndex0 = (password[index0 - 1] == character[0]);
|
||||||
|
bool hasIndex1 = (password[index1 - 1] == character[0]);
|
||||||
|
if ((hasIndex0 && hasIndex1) || (hasIndex0 == false && hasIndex1 == false)) { continue; }
|
||||||
|
if (hasIndex0 || hasIndex1) { cntValid++; }
|
||||||
|
}
|
||||||
|
|
||||||
|
return cntValid.ToString();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -7,12 +7,13 @@ namespace AdventOfCode2020
|
|||||||
{
|
{
|
||||||
static void Main(string[] args)
|
static void Main(string[] args)
|
||||||
{
|
{
|
||||||
int currentDayNumber = 1;
|
int currentDayNumber = 2;
|
||||||
IDay currentDay = null;
|
IDay currentDay = null;
|
||||||
|
|
||||||
switch (currentDayNumber)
|
switch (currentDayNumber)
|
||||||
{
|
{
|
||||||
case 1: currentDay = new Day01(); break;
|
case 1: currentDay = new Day01(); break;
|
||||||
|
case 2: currentDay = new Day02(); break;
|
||||||
}
|
}
|
||||||
|
|
||||||
Console.WriteLine(string.Format("Day {0:00}", currentDayNumber));
|
Console.WriteLine(string.Format("Day {0:00}", currentDayNumber));
|
||||||
|
|||||||
1000
AdventOfCode2020/inputs/Day02.txt
Normal file
1000
AdventOfCode2020/inputs/Day02.txt
Normal file
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user