2025/8/odin: wip

2025/2/nu/Makefile

@@ -0,0 +1,2 @@
+all:
+	./main.nu

2025/2/nu/main.nu

@@ -12,6 +12,11 @@ def part-1 [parsed] {
   } | flatten | math sum 
 }
 
+def part-2 [parsed] {
+  $parsed
+  | 
+}
+
 let input = open input
 let parsed = $input
            | str trim
@@ -23,4 +28,4 @@ let parsed = $input
            | into int l u
            | each {|row| $row.l..$row.u}
 
-timeit {print (part-1 $parsed)}
+part-2 ($input | str trim | split row ',' | split column '-' | rename l u | into int l u)

2025/8/ex_input

@@ -0,0 +1,20 @@
+162,817,812
+57,618,57
+906,360,560
+592,479,940
+352,342,300
+466,668,158
+542,29,236
+431,825,988
+739,650,466
+52,470,668
+216,146,977
+819,987,18
+117,168,530
+805,96,715
+346,949,466
+970,615,88
+941,993,340
+862,61,35
+984,92,344
+425,690,689

2025/8/odin/main.odin

@@ -0,0 +1,40 @@
+package day_8
+
+import "core:fmt"
+import "core:strconv"
+import "core:strings"
+
+input :: cast(string)#load("../ex_input")
+
+Pos :: [3]int
+
+parse :: proc(input: string) -> (res: []Pos, ok: bool) {
+	data: [dynamic]Pos
+	for line in strings.split_lines(strings.trim_space(input)) {
+		raw_pos := strings.split(line, ",")
+		pos: Pos
+		for &v, i in pos {
+			v = strconv.parse_int(raw_pos[i]) or_return
+		}
+		append(&data, pos)
+	}
+	return data[:], true
+}
+
+solve_1 :: proc(data: []Pos) -> int {
+	edges: map[Pos]Pos
+	for p1 in data {
+		for p2 in data {
+			if p1 == p2 do continue
+			if p1 not_in edges do edges[p1] = p2
+		}
+	}
+	fmt.println(edges)
+	return 0
+}
+
+main :: proc() {
+	data, ok := parse(input)
+	if !ok do fmt.eprintln("failed to parse")
+	fmt.println(solve_1(data))
+}