input;
+
+void Main()
+{
+ input = File
+ .ReadAllLines(Path.Combine(Path.GetDirectoryName(Util.CurrentQueryPath), @"10_input.txt"))
+ .Where(p => !string.IsNullOrWhiteSpace(p))
+ .Select(l => new P
+ {
+ XX=int.Parse(l.Substring(10,6).Trim()),
+ YY=int.Parse(l.Substring(18,6).Trim()),
+ VX=int.Parse(l.Substring(36,2).Trim()),
+ VY=int.Parse(l.Substring(40,2).Trim()),
+ })
+ .ToList();
+
+
+
+ for (;;)
+ {
+ foreach (var v in input) { v.XX += v.VX; v.YY += v.VY; }
+
+
+ if (input.Any(Alone)) continue;
+ Print();
+
+ return;
+ }
+
+}
+
+bool Alone(P p) => !input.Any(i => i != p && Math.Abs(i.XX-p.XX)<=1 && Math.Abs(i.YY-p.YY)<=1);
+
+void Print()
+{
+ int minX = input.Min(i => i.XX);
+ int maxX = input.Max(i => i.XX);
+ int minY = input.Min(i => i.YY);
+ int maxY = input.Max(i => i.YY);
+
+ var b = new StringBuilder();
+ for (int y = minY; y <= maxY; y++)
+ {
+ for (int x = minX; x <= maxX; x++)
+ {
+ b.Append(input.Any(i => i.XX==x&&i.YY==y)?'#':'.');
+ }
+ b.AppendLine();
+ }
+ b.ToString().Dump();
+
+}
diff --git a/www/statics/aoc/2018/10-2.linq b/www/statics/aoc/2018/10-2.linq
new file mode 100644
index 0000000..d6d6358
--- /dev/null
+++ b/www/statics/aoc/2018/10-2.linq
@@ -0,0 +1,56 @@
+
input;
+
+void Main()
+{
+ input = File
+ .ReadAllLines(Path.Combine(Path.GetDirectoryName(Util.CurrentQueryPath), @"10_input.txt"))
+ .Where(p => !string.IsNullOrWhiteSpace(p))
+ .Select(l => new P
+ {
+ XX = int.Parse(l.Substring(10, 6).Trim()),
+ YY = int.Parse(l.Substring(18, 6).Trim()),
+ VX = int.Parse(l.Substring(36, 2).Trim()),
+ VY = int.Parse(l.Substring(40, 2).Trim()),
+ })
+ .ToList();
+
+
+
+ for (int i = 1; ; i++)
+ {
+ foreach (var v in input) { v.XX += v.VX; v.YY += v.VY; }
+
+
+ if (input.Any(Alone)) continue;
+ //Print();
+ i.Dump();
+ return;
+ }
+
+}
+
+bool Alone(P p) => !input.Any(i => i != p && Math.Abs(i.XX - p.XX) <= 1 && Math.Abs(i.YY - p.YY) <= 1);
+
+void Print()
+{
+ int minX = input.Min(i => i.XX);
+ int maxX = input.Max(i => i.XX);
+ int minY = input.Min(i => i.YY);
+ int maxY = input.Max(i => i.YY);
+
+ var b = new StringBuilder();
+ for (int y = minY; y <= maxY; y++)
+ {
+ for (int x = minX; x <= maxX; x++)
+ {
+ b.Append(input.Any(i => i.XX == x && i.YY == y) ? '#' : '.');
+ }
+ b.AppendLine();
+ }
+ b.ToString().Dump();
+
+}
diff --git a/www/statics/aoc/2018/10_challenge.txt b/www/statics/aoc/2018/10_challenge.txt
new file mode 100644
index 0000000..56d3acb
--- /dev/null
+++ b/www/statics/aoc/2018/10_challenge.txt
@@ -0,0 +1,149 @@
+--- Day 10: The Stars Align ---
+
+It's no use; your navigation system simply isn't capable of providing walking directions in the arctic circle, and certainly not in 1018.
+
+The Elves suggest an alternative. In times like these, North Pole rescue operations will arrange points of light in the sky to guide missing Elves back to base. Unfortunately, the message is easy to miss: the points move slowly enough that it takes hours to align them, but have so much momentum that they only stay aligned for a second. If you blink at the wrong time, it might be hours before another message appears.
+
+You can see these points of light floating in the distance, and record their position in the sky and their velocity, the relative change in position per second (your puzzle input). The coordinates are all given from your perspective; given enough time, those positions and velocities will move the points into a cohesive message!
+
+Rather than wait, you decide to fast-forward the process and calculate what the points will eventually spell.
+
+For example, suppose you note the following points:
+
+position=< 9, 1> velocity=< 0, 2>
+position=< 7, 0> velocity=<-1, 0>
+position=< 3, -2> velocity=<-1, 1>
+position=< 6, 10> velocity=<-2, -1>
+position=< 2, -4> velocity=< 2, 2>
+position=<-6, 10> velocity=< 2, -2>
+position=< 1, 8> velocity=< 1, -1>
+position=< 1, 7> velocity=< 1, 0>
+position=<-3, 11> velocity=< 1, -2>
+position=< 7, 6> velocity=<-1, -1>
+position=<-2, 3> velocity=< 1, 0>
+position=<-4, 3> velocity=< 2, 0>
+position=<10, -3> velocity=<-1, 1>
+position=< 5, 11> velocity=< 1, -2>
+position=< 4, 7> velocity=< 0, -1>
+position=< 8, -2> velocity=< 0, 1>
+position=<15, 0> velocity=<-2, 0>
+position=< 1, 6> velocity=< 1, 0>
+position=< 8, 9> velocity=< 0, -1>
+position=< 3, 3> velocity=<-1, 1>
+position=< 0, 5> velocity=< 0, -1>
+position=<-2, 2> velocity=< 2, 0>
+position=< 5, -2> velocity=< 1, 2>
+position=< 1, 4> velocity=< 2, 1>
+position=<-2, 7> velocity=< 2, -2>
+position=< 3, 6> velocity=<-1, -1>
+position=< 5, 0> velocity=< 1, 0>
+position=<-6, 0> velocity=< 2, 0>
+position=< 5, 9> velocity=< 1, -2>
+position=<14, 7> velocity=<-2, 0>
+position=<-3, 6> velocity=< 2, -1>
+
+Each line represents one point. Positions are given as