Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

aoc 1+2

Browse Source
This commit is contained in:
Mike Schwörer
2019-12-02 14:27:20 +01:00
parent 4a43239aa1
commit d23c3f45be
61 changed files with 344 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
www/statics/aoc/2018/06_solution-2.linq Normal file
View File

@@ -0,0 +1,25 @@
<Query Kind="Statements" />
var coords = File
.ReadAllLines(Path.Combine(Path.GetDirectoryName(Util.CurrentQueryPath), @"06_input.txt"))
.Where(p => !string.IsNullOrWhiteSpace(p))
.Select(l => (int.Parse(l.Split(',')[0].Trim()), int.Parse(l.Split(',')[1].Trim())))
.ToList();
var minX = coords.Min(p => p.Item1) - 5_000;
var maxX = coords.Max(p => p.Item1) + 5_000;
var minY = coords.Min(p => p.Item2) - 5_000;
var maxY = coords.Max(p => p.Item2) + 5_000;
int r = 0;
for (int x = minX; x <= maxX; x++)
for (int y = minX; y <= maxY; y++)
{
var s1 = coords.Sum(c => Math.Abs(c.Item1 - x) + Math.Abs(c.Item2 - y));
if (s1 < 10_000) r++;
Util.Progress=((x-minX)*100)/(maxX-minX);
}
r.Dump();