-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay07.cs
More file actions
90 lines (74 loc) · 2.34 KB
/
Day07.cs
File metadata and controls
90 lines (74 loc) · 2.34 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
namespace aoc.y2024;
[RunnableDay(year: 2024, day: 7)]
class Day07 : Day
{
public override string PartOne()
{
var result = 0L;
foreach (var line in ReadInputLines())
{
result += CalculateEquation(line, ['+', '*']);
}
return result.ToString();
}
public override string PartTwo()
{
var result = 0L;
foreach (var line in ReadInputLines())
{
result += CalculateEquation(line, ['+', '*', '|']);
}
return result.ToString();
}
private static long CalculateEquation(string equation, char[] availableOperators)
{
var allValues = equation.Split([' ', ':']).Where(c => c != "").ToList().ConvertAll(long.Parse);
var testValue = allValues[0];
var equationValues = allValues[1..];
var operationsPermutations = GeneratePermutations(availableOperators, equationValues.Count - 1);
foreach (var operationPermutation in operationsPermutations)
{
var acc = equationValues[0];
for (int i = 1; i < equationValues.Count; i++)
{
var value = equationValues[i];
var operation = operationPermutation[i - 1];
switch (operation)
{
case '+':
acc += value;
break;
case '*':
acc *= value;
break;
case '|':
acc = long.Parse(acc.ToString() + value.ToString());
break;
}
}
if (acc == testValue)
{
return testValue;
}
}
return 0;
}
private static List<string> GeneratePermutations(char[] items, int length)
{
List<string> result = [];
GeneratePermutationsRecursive(items, "", length, result);
return result;
}
private static void GeneratePermutationsRecursive(char[] items, string current, int length, List<string> result)
{
if (current.Length == length)
{
result.Add(current);
return;
}
foreach (char item in items)
{
GeneratePermutationsRecursive(items, current + item, length, result);
}
}
}