From 91604d0474f964ae03194a463b577ea4bf1b4044 Mon Sep 17 00:00:00 2001
From: tiennm99 <tiennm99@outlook.com>
Date: Wed, 10 Dec 2025 18:47:10 +0700
Subject: [PATCH] feat(2025): add day10 part1

---
 2025/day10/day10.go | 101 ++++++++++++++++++++++++++++++++++++++++++++
 2025/day10/go.mod   |   5 +++
 2025/day10/go.sum   |   2 +
 2025/go.mod         |   4 ++
 README.md           |   2 -
 5 files changed, 112 insertions(+), 2 deletions(-)
 create mode 100644 2025/day10/day10.go
 create mode 100644 2025/day10/go.mod
 create mode 100644 2025/day10/go.sum
 create mode 100644 2025/go.mod

diff --git a/2025/day10/day10.go b/2025/day10/day10.go
new file mode 100644
index 0000000..0b82b44
--- /dev/null
+++ b/2025/day10/day10.go
@@ -0,0 +1,101 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"os"
+	"strconv"
+	"strings"
+
+	mapset "github.com/deckarep/golang-set/v2"
+)
+
+func main() {
+	f, err := os.Open("input.txt")
+	if err != nil {
+		panic(err)
+	}
+	defer f.Close()
+
+	scanner := bufio.NewScanner(f)
+
+	totalPresses := 0
+
+	for scanner.Scan() {
+		line := strings.TrimSpace(scanner.Text())
+		if line == "" {
+			continue
+		}
+
+		parts := strings.Fields(line)
+		if len(parts) < 3 {
+			continue
+		}
+
+		diagram := parts[0]
+
+		pattern := diagram[1 : len(diagram)-1]
+		want := 0
+		for i := 0; i < len(pattern); i++ {
+			if pattern[i] == '#' {
+				want |= (1 << i)
+			}
+		}
+
+		var have []int
+		for i := 1; i < len(parts)-1; i++ {
+			btn := parts[i]
+			content := btn[1 : len(btn)-1]
+			if len(content) == 0 {
+				continue
+			}
+			fields := strings.Split(content, ",")
+			mask := 0
+			for _, f := range fields {
+				idx, err := strconv.Atoi(f)
+				if err != nil {
+					panic(err)
+				}
+				mask |= (1 << idx)
+			}
+			have = append(have, mask)
+		}
+
+		type node struct {
+			cost int
+			val  int
+		}
+
+		queue := []node{{0, 0}}
+		visited := mapset.NewSet[int]()
+		visited.Add(0)
+
+		foundCost := -1
+
+		for len(queue) > 0 {
+			cur := queue[0]
+			queue = queue[1:]
+
+			if cur.val == want {
+				foundCost = cur.cost
+				break
+			}
+
+			for _, b := range have {
+				nv := cur.val ^ b
+				if !visited.Contains(nv) {
+					visited.Add(nv)
+					queue = append(queue, node{cur.cost + 1, nv})
+				}
+			}
+		}
+
+		if foundCost < 0 {
+			panic("no solution found for a machine")
+		}
+
+		totalPresses += foundCost
+	}
+
+	fmt.Println(totalPresses)
+}
diff --git a/2025/day10/go.mod b/2025/day10/go.mod
new file mode 100644
index 0000000..ad7cd02
--- /dev/null
+++ b/2025/day10/go.mod
@@ -0,0 +1,5 @@
+module day10
+
+go 1.23.4
+
+require github.com/deckarep/golang-set/v2 v2.8.0
diff --git a/2025/day10/go.sum b/2025/day10/go.sum
new file mode 100644
index 0000000..f5de140
--- /dev/null
+++ b/2025/day10/go.sum
@@ -0,0 +1,2 @@
+github.com/deckarep/golang-set/v2 v2.8.0 h1:swm0rlPCmdWn9mESxKOjWk8hXSqoxOp+ZlfuyaAdFlQ=
+github.com/deckarep/golang-set/v2 v2.8.0/go.mod h1:VAky9rY/yGXJOLEDv3OMci+7wtDpOF4IN+y82NBOac4=
diff --git a/2025/go.mod b/2025/go.mod
new file mode 100644
index 0000000..14705fc
--- /dev/null
+++ b/2025/go.mod
@@ -0,0 +1,4 @@
+// Note: I use LLM to generate solutions since day 8.
+module 2025
+
+go 1.24
diff --git a/README.md b/README.md
index ed26592..34da63d 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,2 @@
 # adventofcode
 [Advent of Code](https://adventofcode.com/2025) solutions
-
-**Note**: *I use LLM to generate solutions since day 8*.