-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay19Task1Tests.cs
More file actions
191 lines (157 loc) · 5.02 KB
/
Day19Task1Tests.cs
File metadata and controls
191 lines (157 loc) · 5.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
using FluentAssertions;
using NUnit.Framework;
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace AdventOfCode2020.Tests
{
[TestFixture]
public class Day19Task1Tests
{
Day19Task1 Solver() => new Day19Task1();
[Test]
public void solves_example()
{
string input = @"0: 4 1 5
1: 2 3 | 3 2
2: 4 4 | 5 5
3: 4 5 | 5 4
4: ""a""
5: ""b""
ababbb
bababa
abbbab
aaabbb
aaaabbb";
var result = Solver().Solve(input);
result.Should().Be(2);
}
[Test]
public void parse_rules()
{
string input = @"0: 4 1 5
1: 2 3 | 3 2
2: 4 4 | 5 5
3: 4 5 | 5 4
4: ""a""
5: ""b""";
var result = Solver().ParseRules(input);
var hs = result[0].GetAllowedMessages();
hs.Should().Contain("ababbb");
hs.Should().Contain("abbbab");
hs.Should().NotContain("bababa");
hs.Should().NotContain("aaabbb");
hs.Should().NotContain("aaaabbb");
hs.Should().HaveCount(8);
hs.Should().Contain("aaaabb");
hs.Should().Contain("aaabab");
hs.Should().Contain("abbabb");
hs.Should().Contain("abbbab");
hs.Should().Contain("aabaab");
hs.Should().Contain("aabbbb");
hs.Should().Contain("abaaab");
hs.Should().Contain("ababbb");
//"0: a aa ab b | a aa ba b | a bb ab b | a bb ba b | a ab aa b | a ab bb b | a ba aa b | a ba bb b"
//"1: aa ab | aa ba | bb ab | bb ba | ab aa | ab bb | ba aa | ba bb"
//"2: a a | b b"
//"3: a b | b a"
//"4: a"
//"5: b"
}
[Test]
public void parse_rules_extended()
{
string input = @"0: 6 | 7
7: 1
6: 4 1 5
1: 2 3 | 3 2
2: 4 4 | 5 5
3: 4 5 | 5 4
4: ""a""
5: ""b""";
var result = Solver().ParseRules(input);
var hs = result[0].GetAllowedMessages();
hs.Should().Contain("ababbb");
hs.Should().Contain("abbbab");
hs.Should().NotContain("bababa");
hs.Should().NotContain("aaabbb");
hs.Should().NotContain("aaaabbb");
hs.Should().HaveCount(16);
hs.Should().Contain("aaaabb");
hs.Should().Contain("aaabab");
hs.Should().Contain("abbabb");
hs.Should().Contain("abbbab");
hs.Should().Contain("aabaab");
hs.Should().Contain("aabbbb");
hs.Should().Contain("abaaab");
hs.Should().Contain("ababbb");
hs.Should().Contain("aaab");
hs.Should().Contain("aaba");
hs.Should().Contain("bbab");
hs.Should().Contain("bbba");
hs.Should().Contain("abaa");
hs.Should().Contain("abbb");
hs.Should().Contain("baaa");
hs.Should().Contain("babb");
//"6: a aa ab b | a aa ba b | a bb ab b | a bb ba b | a ab aa b | a ab bb b | a ba aa b | a ba bb b"
//"1: aa ab | aa ba | bb ab | bb ba | ab aa | ab bb | ba aa | ba bb"
//"2: a a | b b"
//"3: a b | b a"
//"4: a"
//"5: b"
}
[Test]
public void parse_example_2()
{
string input = @"0: 1 | 11
1: ""a""
11: ""b""";
var result = Solver().ParseRules(input);
var hs = result[0].GetAllowedMessages();
hs.Should().Contain("a");
hs.Should().Contain("b");
}
[Test]
public void solves_input()
{
string input = File.ReadAllText("Files\\Day19.txt");
var result = Solver().Solve(input);
result.Should().Be(195);
}
[Test]
public void solves_input_2()
{
string input = File.ReadAllText("Files\\Day19_1.txt");
var result = Solver().Solve(input);
result.Should().Be(230);
}
[Test]
public void check_matches_for_input_2()
{
string input = File.ReadAllText("Files\\Day19_1.txt");
string matches = File.ReadAllText("Files\\Day19_1_matches.txt");
var rules = Solver().ParseRules(input.Split($"{Environment.NewLine}{Environment.NewLine}")[0]);
var messages = rules[0].GetAllowedMessages();
var shouldBeZero = matches.Split(Environment.NewLine, StringSplitOptions.RemoveEmptyEntries)
.Where(x => !messages.Contains(x));
shouldBeZero.Should().HaveCount(0);
}
[Test]
public void check_example_of_two_the_same()
{
string input = @"0: 28 28
28: 77 | 91
77: ""a""
91: ""b""";
var result = Solver().ParseRules(input);
var hs = result[0].GetAllowedMessages();
hs.Should().Contain("aa");
hs.Should().Contain("bb");
hs.Should().Contain("ab");
hs.Should().Contain("ba");
}
}
}