From 646467da4d6e5db9173c6c9b6c5dc9a040498941 Mon Sep 17 00:00:00 2001
From: Curtis McEnroe <june@causal.agency>
Date: Sun, 23 Dec 2018 12:46:17 -0500
Subject: Solve day 23 part 1

---
 2018/day23.c | 47 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 2018/day23.c

diff --git a/2018/day23.c b/2018/day23.c
new file mode 100644
index 0000000..dca2a0b
--- /dev/null
+++ b/2018/day23.c
@@ -0,0 +1,47 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+typedef unsigned uint;
+
+struct Point {
+	int x, y, z;
+};
+
+static int distance(struct Point a, struct Point b) {
+	int x = (a.x > b.x ? a.x - b.x : b.x - a.x);
+	int y = (a.y > b.y ? a.y - b.y : b.y - a.y);
+	int z = (a.z > b.z ? a.z - b.z : b.z - a.z);
+	return x + y + z;
+}
+
+struct Bot {
+	struct Point pos;
+	int radius;
+};
+
+int main(void) {
+	uint len = 0;
+	struct Bot bots[1000];
+	while (!feof(stdin)) {
+		scanf(
+			"pos=<%d,%d,%d>, r=%d\n",
+			&bots[len].pos.x, &bots[len].pos.y, &bots[len].pos.z,
+			&bots[len].radius
+		);
+		len++;
+	}
+
+	uint max, maxRadius = 0;
+	for (uint i = 0; i < len; ++i) {
+		if (bots[i].radius < maxRadius) continue;
+		max = i;
+		maxRadius = bots[i].radius;
+	}
+
+	uint inRange = 0;
+	for (uint i = 0; i < len; ++i) {
+		if (distance(bots[i].pos, bots[max].pos) > bots[max].radius) continue;
+		inRange++;
+	}
+	printf("%u\n", inRange);
+}
-- 
cgit 1.4.1