-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay7.cs
60 lines (51 loc) · 1.49 KB
/
Day7.cs
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
namespace AdventOfCode2021;
public static class Day7
{
public static void Part1()
{
string[] inputs = InputHelper.GetInput(7);
IEnumerable<int> crabPositions = inputs[0]
.Split(',')
.Select(x => int.Parse(x));
int bestPosition = -1;
int bestCost = int.MaxValue;
for (int position = 0; position < crabPositions.Max(); position++)
{
int cost = 0;
foreach (int crab in crabPositions)
{
cost += Math.Abs(crab - position);
}
if (cost < bestCost)
{
bestCost = cost;
bestPosition = position;
}
}
Console.WriteLine(bestCost);
}
public static void Part2()
{
string[] inputs = InputHelper.GetInput(7);
IEnumerable<int> crabPositions = inputs[0]
.Split(',')
.Select(x => int.Parse(x));
int bestPosition = -1;
int bestCost = int.MaxValue;
for (int position = 0; position < crabPositions.Max(); position++)
{
int cost = 0;
foreach (int crab in crabPositions)
{
int distance = Math.Abs(crab - position);
cost += (distance * (distance + 1)) / 2;
}
if (cost < bestCost)
{
bestCost = cost;
bestPosition = position;
}
}
Console.WriteLine(bestCost);
}
}