Year 2022 Day 25

Author: maneatingape

README.md

@@ -1,6 +1,6 @@
 # Advent of Code
 
-In progress 2022 and complete 2021 to 2015 entries for the annual [Advent of Code](https://adventofcode.com/) challenge, written in concise idiomatic functional Scala.
+Complete 2022 to 2015 entries for the annual [Advent of Code](https://adventofcode.com/) challenge, written in concise idiomatic functional Scala.
 
 The coding style philosophy is [Readability](https://www.lihaoyi.com/post/StrategicScalaStylePrincipleofLeastPower.html) > [Simplicity](https://en.wikipedia.org/wiki/KISS_principle) > [Performance](https://www.laws-of-software.com/laws/knuth/).
 
@@ -55,6 +55,7 @@ The minimal SBT project provides:
 | 22 | [Monkey Map](https://adventofcode.com/2022/day/22) | [Source](src/main/scala/AdventOfCode2022/Day22.scala) |
 | 23 | [Unstable Diffusion](https://adventofcode.com/2022/day/23) | [Source](src/main/scala/AdventOfCode2022/Day23.scala) |
 | 24 | [Blizzard Basin](https://adventofcode.com/2022/day/24) | [Source](src/main/scala/AdventOfCode2022/Day24.scala) |
+| 25 | [Full of Hot Air](https://adventofcode.com/2022/day/25) | [Source](src/main/scala/AdventOfCode2022/Day25.scala) |
 
 ## 2021
 

src/main/resources/AdventOfCode2022/Day25.txt

@@ -0,0 +1,111 @@
+1=021=20---11-1=1
+222==-=1-2=-11-11
+1010==0=0=1--=1
+2
+1122=
+2222==2222-2--10
+100=-2-002=
+12221-2-10-=1=
+1-=211000=221-1
+2=--12==11221-2-002
+1101==-01===01=
+220=0=-2-1-0===10=2
+2-0-
+1=-12=2==
+1-=-02==-1
+100-0-11--02--0=-
+1==0-1220011=-
+21
+1102-22==
+222
+1==0=22-0--011-0
+1020
+2==2-102
+1010-02==02=
+1=1
+2=010==12022=
+1=-22001-2=
+101=2-201122111
+1=-0021211-1-1-1202
+2-22-2
+1212002==1
+2=-0-
+1-1==1122110100
+1--020-2-=-0-21--
+2=22-21220022==1=
+1=-00-121-20-2122
+1-==-00
+20=21=0
+20-02-0-=-==-=22
+1120==-2
+2=--0-0-000201=101
+1---=02=21
+1-011
+211-2112=20--2
+1=-
+1=--=021
+1-1-122200==1-1111
+11001-
+200=200
+1===21=1-2
+1===10
+2=22
+10-110210=01112-
+2121=1=2=-201-
+1---2=-0=-
+211-120---000=-0-
+1-
+1-101-2=01020=-0=
+112-12--0=12=12--
+1-0-=2--=--12=20
+1=0=-121
+1000122-210--011200
+120==-1-=01
+1=2=1--
+101-1=--2-
+2=
+2--10
+2201020-=2-
+1===2001-1=0=
+222=-2---2=112
+2010=-22=012=202=
+111
+1-2112=0200=1
+2=02211=2
+2-121
+1----12=-2011
+2==0
+112
+22=0==1-1=
+1-20=0-
+1=110211-022201222
+20
+1-111
+1=-=022011=2=2=1
+1-02122
+2-1
+1-2-=2-0=0---
+1-20
+1=1=102
+1=1=0--1
+11222-==0101-
+2122100=0
+2011==12-10
+210--121-0=
+22121=01=0=-=-=-==
+10-0-=1-12
+2-2=21
+1=1-0-0-
+10020
+10-0-0120=211-2-
+1-==10-0-==001201-
+1-0
+21=00202002-0
+1-1=2021
+11=1==1=0
+1=102-1=-20-0
+2=100-12-0=
+1=0
+1--=
+12=212110200-
+222002100

src/main/scala/AdventOfCode2022/Day25.scala

@@ -0,0 +1,27 @@
+package AdventOfCode2022
+
+object Day25:
+  def fromSnafu(s: String): Long = s.foldLeft(0L) { (total, c) =>
+    val digit = c match
+      case '0' => 0
+      case '1' => 1
+      case '2' => 2
+      case '=' => -2
+      case '-' => -1
+    5 * total + digit
+  }
+
+  def toSnafu(i: Long, s: String = ""): String = if i == 0 then s else
+    val (digit, prefix) = i % 5 match
+      case 0 => (0, "0")
+      case 1 => (1, "1")
+      case 2 => (2, "2")
+      case 3 => (-2, "=")
+      case 4 => (-1, "-")
+    toSnafu((i - digit) / 5, prefix + s)
+
+  def part1(input: Seq[String]): String = toSnafu(input.map(fromSnafu).sum)
+
+  def main(args: Array[String]): Unit =
+    val data = io.Source.fromResource("AdventOfCode2022/Day25.txt").getLines().toSeq
+    println(part1(data))

src/test/scala/AdventOfCode2022/Day25Suite.scala

@@ -0,0 +1,23 @@
+package AdventOfCode2022
+
+import org.scalatest.funsuite.AnyFunSuite
+
+class Day25Suite extends AnyFunSuite:
+  val sample = Seq(
+    "1=-0-2",
+    "12111",
+    "2=0=",
+    "21",
+    "2=01",
+    "111",
+    "20012",
+    "112",
+    "1=-1=",
+    "1-12",
+    "12",
+    "1=",
+    "122")
+
+  test("Part 1 should handle sample input correctly") {
+    assert(Day25.part1(sample) == "2=-1=0")
+  }