aboutsummaryrefslogtreecommitdiff
path: root/2021/18/second.go
diff options
context:
space:
mode:
authorJulien Dessaux2021-12-20 23:15:56 +0100
committerJulien Dessaux2021-12-20 23:16:51 +0100
commit11088124920c7bc8bd1c54c4265e9dcafb7a024b (patch)
treed9743eaf93ad6abd7ae46a8abda07e19a0527ad6 /2021/18/second.go
parentAdded solutions for 17th day: target practice (diff)
downloadadvent-of-code-11088124920c7bc8bd1c54c4265e9dcafb7a024b.tar.gz
advent-of-code-11088124920c7bc8bd1c54c4265e9dcafb7a024b.tar.bz2
advent-of-code-11088124920c7bc8bd1c54c4265e9dcafb7a024b.zip
Added solutions for 18th day: snailfish arithmetic
Diffstat (limited to '2021/18/second.go')
-rw-r--r--2021/18/second.go35
1 files changed, 35 insertions, 0 deletions
diff --git a/2021/18/second.go b/2021/18/second.go
new file mode 100644
index 0000000..6070d74
--- /dev/null
+++ b/2021/18/second.go
@@ -0,0 +1,35 @@
+package main
+
+import (
+ "fmt"
+ "os"
+
+ "git.adyxax.org/aoc/2021/18/pairs"
+)
+
+func main() {
+ max := 0
+ parser := pairs.NewParser(os.Stdin)
+ pairs := make([]*pairs.Pair, 0)
+ for {
+ pair, err := parser.Parse()
+ if err != nil {
+ break
+ }
+ pairs = append(pairs, pair)
+ }
+ l := len(pairs)
+ for i := 0; i < l; i++ {
+ for j := 0; j < l; j++ {
+ if i == j {
+ continue
+ }
+ p1 := pairs[i].DeepCopy()
+ p2 := pairs[j].DeepCopy()
+ if m := p1.Add(p2).Magnitude(); max < m {
+ max = m
+ }
+ }
+ }
+ fmt.Println(max)
+}