Skip to content

Instantly share code, notes, and snippets.

@Trinitek

Trinitek/advent2017-2.cs

Last active December 4, 2020 04:28
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save Trinitek/8ffd03dd98af168949456abb07b0b830 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save Trinitek/8ffd03dd98af168949456abb07b0b830 to your computer and use it in GitHub Desktop.
Download ZIP
AdventOfCode 2017
Raw
advent2017-2.cs
void Main()
{
var lines = Input.Trim().Split("\n").Select(l => l.Trim());
int checksum = 0;
foreach (var line in lines)
{
var row = Row.Parse(line);
//row.cells.Dump();
//checksum += row.Difference;
checksum += row.Divisor;
}
checksum.Dump();
}
record Row(int[] cells)
{
public int Difference => cells.Max() - cells.Min();
public int Divisor {
get {
var sorted = cells.OrderByDescending(c => c).ToArray();
for (int a = 0; a < cells.Length; a++) {
for (int b = a + 1; b < cells.Length; b++) {
int ca = sorted[a];
int cb = sorted[b];
if (ca % cb == 0) {
return ca / cb;
}
}
}
return 0;
}
}
public static Row Parse(string line)
{
line = line.Trim();
var strCells = line.Split(new string[] { " ", "\t" }, StringSplitOptions.RemoveEmptyEntries | StringSplitOptions.TrimEntries);
var cells = strCells.Select(c => int.Parse(c));
return new Row(cells.ToArray());
}
}
string Input = @"
414 382 1515 319 83 1327 116 391 101 749 1388 1046 1427 105 1341 1590
960 930 192 147 932 621 1139 198 865 820 597 165 232 417 19 183
3379 987 190 3844 1245 1503 3151 3349 2844 4033 175 3625 3565 179 3938 184
116 51 32 155 102 92 65 42 48 91 74 69 52 89 20 143
221 781 819 121 821 839 95 117 626 127 559 803 779 543 44 369
199 2556 93 1101 122 124 2714 625 2432 1839 2700 2636 118 2306 1616 2799
56 804 52 881 1409 47 246 1368 1371 583 49 1352 976 400 1276 1240
1189 73 148 1089 93 76 3205 3440 3627 92 853 95 3314 3551 2929 3626
702 169 492 167 712 488 357 414 187 278 87 150 19 818 178 686
140 2220 1961 1014 2204 2173 1513 2225 443 123 148 580 833 1473 137 245
662 213 1234 199 1353 1358 1408 235 917 1395 1347 194 565 179 768 650
119 137 1908 1324 1085 661 1557 1661 1828 1865 432 110 658 821 1740 145
1594 222 4140 963 209 2782 180 2591 4390 244 4328 3748 4535 192 157 3817
334 275 395 128 347 118 353 281 430 156 312 386 160 194 63 141
146 1116 153 815 2212 2070 599 3018 2640 47 125 2292 165 2348 2694 184
1704 2194 1753 146 2063 1668 1280 615 163 190 2269 1856 150 158 2250 2459
";
Raw
advent2017-3.cs
void Main()
{
var cells = new Dictionary<CellReference, Cell>();
void AddCell(Cell cell) => cells.Add(cell.GetReference(), cell);
Cell FindCell(CellReference reference) => reference.GetCell(r =>
{
cells.TryGetValue(reference, out var c);
return c;
});
var start = new Cell(0, 1, 0, 0, Enumerable.Empty<Cell>());
AddCell(start);
Cell next = start;
next.Dump();
int stopIndex = 277678;
const string pbCaption = "Building cell map...";
var pb = new Util.ProgressBar().Dump();
bool hitThreshold = false;
for (int i = 0; i < stopIndex - 1; i++)
{
//var nextCoord = next.GetNextCell();
//next = new Cell(nextCoord.ring, i + 2, nextCoord.x, nextCoord.y, null);
//next.Dump();
next = next.GetNextCell(FindCell);
AddCell(next);
pb.Caption = $"{pbCaption} {i + 2}/{stopIndex}";
pb.Fraction = (i) / ((double)stopIndex);
//next.Dump();
if (next.Sum > (ulong)stopIndex && !hitThreshold)
{
next.Dump();
hitThreshold = true;
//break;
}
}
next.Dump();
//next.GetSum().Dump();
}
Cell FindCell(IEnumerable<Cell> cells, int x, int y)
{
return cells.FirstOrDefault(c => c.X == x && c.Y == y);
}
delegate Cell CellResolverHandler(CellReference reference);
struct CellReference : IEquatable<CellReference>
{
public int X { get; }
public int Y { get; }
public CellReference(int x, int y)
{
X = x;
Y = y;
_shadowCell = null;
}
public CellReference(Cell cell)
: this(cell.X, cell.Y)
{
_shadowCell = cell;
}
public override int GetHashCode() => X + Y;
public bool Equals(CellReference other) => X == other.X && Y == other.Y;
public override bool Equals(object obj) => obj is CellReference cr && Equals(cr);
public Cell GetCell(CellResolverHandler cellResolver) => _shadowCell ?? cellResolver(this);
private readonly Cell _shadowCell;
}
class Cell : IEquatable<Cell>
{
public int Ring { get; }
public int Index { get; }
public int X { get; }
public int Y { get; }
public IEnumerable<Cell> Neighbors { get; }
public ulong Sum { get; }
public Cell(int ring, int index, int x, int y, IEnumerable<Cell> neighbors)
{
Ring = ring;
Index = index;
X = x;
Y = y;
Neighbors = neighbors;
if (Neighbors.Any())
{
foreach (var n in Neighbors)
{
Sum += n.Sum;
}
}
else
{
Sum = 1;
}
}
//public int GetSum(/*CellResolverHandler cellResolver*/) => Neighbors.Any() ? Neighbors.Sum(n => n.GetSum()) : 1;
public CellReference GetReference() => new CellReference(X, Y);
public bool IsBottomMax => Y == -Ring;
public bool IsTopMax => Y == Ring;
public bool IsLeftMax => X == -Ring;
public bool IsRightMax => X == Ring;
public int Distance => Math.Abs(X) + Math.Abs(Y);
public override int GetHashCode() => GetReference().GetHashCode();
public bool Equals(Cell other) => GetReference().Equals(other.GetReference());
public override bool Equals(object obj) => obj is Cell c && Equals(c);
public Cell GetNextCell(CellResolverHandler cellResolver)
{
Cell Next(int nextRing, int nextX, int nextY, params Cell[] nextNeighbors)
=> new (nextRing, Index + 1, nextX, nextY, nextNeighbors.Append(this).Where(n => n is not null));
//CellReference Ref(int x, int y) => new CellReference(x, y);
Cell Ref(int x, int y) => cellResolver(new CellReference(x, y));
//Cell Next(int nextRing, int nextX, int nextY, params CellReference[] nextNeighbors)
// => new Cell(nextRing, Index + 1, nextX, nextY, nextNeighbors.Append(new CellReference(this)).Distinct());
if (Ring == 0) // Seed
{
return Next(1, 1, 0);
}
else if (IsBottomMax && IsRightMax) // Next ring
{
return Next(Ring + 1, X + 1, Y + 0,
Ref(X + 0, Y + 1));
}
else if (IsRightMax && !IsTopMax) // Going up
{
return Next(Ring, X + 0, Y + 1,
Ref(X - 1, Y + 0),
Ref(X - 1, Y + 1),
Ref(X - 1, Y + 2));
}
else if (IsTopMax && !IsLeftMax) // Going left
{
return Next(Ring, X - 1, Y + 0,
Ref(X + 0, Y - 1),
Ref(X - 1, Y - 1),
Ref(X - 2, Y - 1));
}
else if (IsLeftMax && !IsBottomMax) // Going down
{
return Next(Ring, X + 0, Y - 1,
Ref(X + 1, Y + 0),
Ref(X + 1, Y - 1),
Ref(X + 1, Y - 2));
}
else if (IsBottomMax && !IsRightMax) // Going right
{
return Next(Ring, X + 1, Y + 0,
Ref(X + 0, Y + 1),
Ref(X + 1, Y + 1),
Ref(X + 2, Y + 1));
}
else
{
this.Dump();
throw new Exception("Invalid");
}
}
}
Raw
advent2017-5.cs
void Main()
{
Program = Input.Split("\n", StringSplitOptions.RemoveEmptyEntries | StringSplitOptions.TrimEntries).Select(i => int.Parse(i)).ToArray();
int offset = 0;
int steps = 0;
do
{
int nextOfs = Program[offset] + offset;
if (Program[offset] >= 3)
{
Program[offset]--;
}
else
{
Program[offset]++;
}
offset = nextOfs;
steps++;
}
while (offset < Program.Length);
steps.Dump();
}
public int[] Program { get; set; }
public readonly string Input = @"
0
0
1
2
0
1
0
2
-2
-6
0
-7
2
2
1
-2
1
1
-11
-14
-16
-14
-12
-5
-2
-21
-15
-9
0
-13
-4
-19
-31
1
-15
-1
-23
-18
0
-18
-11
-21
-6
2
-38
2
-38
-40
-15
-2
-23
-42
-23
-36
-37
-34
-26
-51
-14
-8
-56
-11
-14
-40
-39
-26
-35
-48
-52
-18
-16
-11
-38
-4
-70
-20
-10
-37
-75
-33
-39
-37
-74
-17
-83
-13
-75
-56
-44
-40
-20
-18
-74
-32
-48
-11
-80
-88
-33
-67
-96
-67
-49
-55
-101
-8
-77
-33
-93
-22
-21
-99
-33
-12
-111
-105
-77
-76
-90
-63
-76
-55
-65
-106
-56
-93
-121
-31
-86
-102
-116
-120
-17
-95
-110
-128
-122
-135
-133
-124
-50
-32
-86
-11
-127
-42
-9
-41
-28
-93
-13
-16
-8
-138
-111
-103
-25
-22
-133
-52
-27
-6
-67
-72
-115
-133
-146
-46
-128
-99
-115
-16
-113
-105
1
-76
-2
1
-66
-164
-87
-8
-92
-180
-137
-39
-127
-124
-66
-96
-185
-13
-65
-178
-16
-32
-24
-84
-49
-7
-198
-101
-119
-187
-71
-125
-130
-72
-130
-43
-136
-171
-32
-210
-69
-195
-207
-197
-190
-117
-196
-143
-128
-155
-160
-53
-205
-15
-86
-227
-128
-115
-58
-96
-52
-100
-41
-84
-61
-50
-91
-158
-30
-230
-125
-177
-181
-47
-43
-241
-52
-102
-161
-16
-130
-21
-22
-249
-78
-101
-51
-229
-148
-132
-213
-264
-175
-128
-102
-26
-86
-84
-100
-132
-228
-118
-46
-77
-230
-98
-193
-191
-142
-193
-183
-58
-59
-254
-256
-108
-12
-46
-11
-143
-22
-121
-68
-282
-94
-22
-172
-246
-174
-76
-3
-117
-237
-258
-29
-105
-32
-177
-125
-70
-176
-113
-152
-227
-298
-199
-179
-162
-241
-230
-8
-202
-296
-194
-82
-188
-136
-24
-171
-185
-272
-124
-306
-230
-249
-64
-139
-143
-293
-218
-167
-208
-254
-171
-119
-82
-284
-262
-252
-92
-230
-193
-173
-269
-173
-13
0
-148
-151
-241
-120
-20
-22
-218
-6
-314
-347
-58
-180
-242
-333
-247
-67
-137
-102
-32
-102
-88
-42
-284
-109
-281
-43
-63
-205
-268
-273
-235
-119
-185
-62
-56
-260
-47
-353
-123
-312
0
-76
-352
-365
-284
-105
-62
-165
-292
-5
-46
-31
-116
-147
-34
-149
-79
-139
-132
-84
-58
-130
-125
-188
-227
-2
-220
-88
-96
-38
-308
-214
-357
-19
-410
-292
-150
-151
1
-252
-172
-414
-15
-207
-184
-286
-161
-55
-158
-330
-53
-310
-295
-248
-126
-425
-10
-289
-148
-146
-436
-279
-48
-321
-196
-162
-55
-125
-62
-381
-337
-85
-428
-470
-180
-392
-450
-376
-73
-206
-115
-289
-318
-22
-200
-176
-410
-380
-470
-418
-163
-424
-288
-374
-358
-386
-340
-403
-81
-7
-378
1
-320
-323
-288
-439
-437
-90
-159
-379
-69
-236
-168
-232
-232
-42
-257
-437
-40
-390
-241
-54
-247
-76
-325
-351
-259
-328
-283
-5
-169
-114
-252
-131
-223
-446
-482
-7
-285
-486
-260
-421
-498
-32
-182
-317
-201
-370
-518
-129
-359
-67
-209
-541
-323
-132
-197
-70
-171
-258
-372
-228
-4
-360
-144
-307
-226
-533
-435
-318
-284
-284
-150
-539
-46
-81
-144
-188
-264
-136
-138
-106
-65
-262
-250
-176
-261
-112
-227
-304
-159
-425
-117
-441
-111
-468
-2
-84
-197
1
-575
-305
-401
-114
-143
-180
-16
-450
-24
-357
-104
-434
-435
-345
-247
-484
-282
-263
-389
-463
-178
-144
-256
-94
-522
-302
-524
-309
-275
-350
-596
-462
-317
-543
-8
-374
-404
-302
-610
-111
-358
2
-353
-397
-165
-324
-574
-618
-168
-636
-389
-609
-54
-121
-256
-604
-588
-454
-100
-212
-65
-300
-592
-43
-230
-652
-638
-67
-499
-614
-419
-577
-96
-257
-519
-458
-14
-26
-370
-187
-319
-528
-436
-87
-673
-535
-473
-670
-594
-589
-629
-180
-13
-668
-369
-679
-587
-624
-123
-363
-241
-343
-259
-123
-319
-608
-470
-336
-291
-676
-535
-226
-11
-224
-43
-30
-605
-670
-544
-248
-609
-144
-328
-177
-360
-628
-51
-724
-407
-625
-433
-192
-455
-603
-581
-33
-696
-160
-464
-510
-3
-144
-113
-87
-519
-263
-161
-94
-716
-484
-509
-615
-373
-734
-686
-732
-395
-163
-432
-26
-716
-599
-596
-648
-91
-716
-540
-429
-456
-744
-344
-298
-689
-428
-119
-323
-196
-41
-602
-724
-413
-444
-614
-331
-697
-115
-7
-409
-272
-672
-224
-732
-203
-37
-397
-794
-161
-512
-664
-193
-245
-490
-439
-696
-661
-717
-424
-308
-481
-215
-658
-705
-389
-90
-619
-297
-670
-125
-119
-268
-553
-227
-733
-142
-333
-52
-609
-795
-422
-202
-579
-397
-431
-561
-140
-467
-688
-486
-493
-279
-457
-295
-181
-823
-808
-495
-620
-652
-80
-22
-26
-769
0
-439
-31
-458
-5
-221
-675
-443
-809
-845
-234
-429
-425
-754
-820
-442
-561
-513
-462
-840
-596
-113
-736
-12
-123
-747
-735
-732
-209
-478
-504
-784
-522
-257
-695
-676
-331
-767
-801
-128
-571
-683
-757
-475
-749
-53
-366
-795
-562
-632
-284
-488
-692
-368
-883
-542
-745
-10
-693
-752
-136
-736
-347
-855
-521
-151
-324
-126
-678
-28
-875
-832
-474
-657
-569
-518
-642
-351
-850
-45
-383
-362
-655
-590
-184
-543
-563
-631
-165
-607
-732
-450
-219
-774
-461
-823
-651
-48
-750
-246
-341
-805
-620
-425
-696
-874
-502
-186
-143
-77
-452
-710
-103
-836
-824
-775
-108
-823
-937
-969
-392
-17
-725
-226
-441
-489
-669
-665
-182
-625
-905
-523
-925
-573
-821
-786
-734
-21
-819
-181
-342
-625
-12
-705
-275
-756
-79
";
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment