1 files changed, 109 insertions, 0 deletions
diff --git a/solutions/py/d10.py b/solutions/py/d10.py
new file mode 100644
index 0000000..1360490
--- /dev/null
+++ b/solutions/py/d10.py
@@ -0,0 +1,109 @@
+import math
+import queue
+
+def red(dcoord):
+    dx = dcoord[0]
+    dy = dcoord[1]
+    if dx == 0:
+        return (0, (1 if dy > 0 else -1))
+    if dy == 0:
+        return ((1 if dx > 0 else -1), 0)
+    gcd = math.gcd(dx, dy)
+    return (dx // gcd, dy // gcd)
+
+input = open("../input/10","r")
+t1 = open("../input/10-test1","r")
+
+input = input.readlines()
+
+asteroids = set()
+res = {}
+
+max_x = len(input[0].rstrip())
+max_y = len(input)
+
+for y in range(max_y):
+    for x in range(max_x):
+        if input[y][x] == "#":
+            asteroids.add((x,y))
+
+for a in asteroids:  # for each asteroid ...
+    candidates = set(asteroids.copy())
+    candidates.remove(a)
+    seen = set()
+    while len(candidates) > 0:
+        c = candidates.pop()
+        seen.add(c)
+        dx = c[0] - a[0]
+        dy = c[1] - a[1]
+        x = a[0]
+        y = a[1]
+        x += dx
+        y += dy
+        dx, dy = red((dx, dy))
+        x += dx
+        y += dy
+        while x < max_x and y < max_y and x >= 0 and y >= 0:
+            if (x, y) in candidates:
+                candidates.remove((x, y))
+            if (x, y) in seen:
+                seen.remove((x, y))
+            x += dx
+            y += dy
+    res[a] = seen
+
+best = [0, 0, 0]
+for coord in res:
+    if (amount := len(res[coord])) > best[0]:
+        best = [amount, coord, res[coord]]
+print(best[0], best[1], best[2])
+asteroids.remove(best[1])
+x0 = best[1][0]
+y0 = best[1][1]
+
+def angle(x, y):
+    if x >= 0 and y > 0:
+        return math.atan(abs(x/y))
+    if x > 0 and y <= 0:
+        return math.atan(abs(y/x)) + math.pi/2
+    if x <= 0 and y < 0:
+        return math.atan(abs(x/y)) + math.pi
+    else:
+        return math.atan(abs(y/x)) + 3*math.pi / 2
+
+angles = {}
+q = queue.Queue()
+for a in asteroids:
+    angles[a] = angle(a[0] - x0, y0 - a[1])
+
+print("sorting")
+for k, v in sorted(angles.items(), key=lambda item: item[1]):
+    print(k, v)
+    if k in best[2]:
+        q.put(k)
+
+print("q", list(q.queue))
+
+destroyed = 1
+while not q.empty():
+    asteroid = q.get()
+    print(destroyed, asteroid)
+    asteroids.remove(asteroid)
+    destroyed += 1
+
+    # add next asteroid behind to queue
+    dx = asteroid[0] - x0
+    dy = asteroid[1] - y0
+    x = x0
+    y = y0
+    x += dx
+    y += dy
+    dx, dy = red((dx, dy))
+    x += dx
+    y += dy
+    while x < max_x and y < max_y and x >= 0 and y >= 0:
+        if (x, y) in asteroids:
+            q.put((x, y))
+            break
+        x += dx
+        y += dy