Solved day 14.

README.md

@@ -18,7 +18,7 @@ Check out [my 2017 participation](https://github.com/FlorianCassayre/AdventOfCod
 * [Day 11](https://adventofcode.com/2018/day/11): [solution](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day11.scala)
 * [Day 12](https://adventofcode.com/2018/day/12): [solution](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day12.scala)
 * [Day 13](https://adventofcode.com/2018/day/13): [solution](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day13.scala)
-* [Day 14](https://adventofcode.com/2018/day/14): –[](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day14.scala)
+* [Day 14](https://adventofcode.com/2018/day/14): [solution](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day14.scala)
 * [Day 15](https://adventofcode.com/2018/day/15): –[](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day15.scala)
 * [Day 16](https://adventofcode.com/2018/day/16): –[](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day16.scala)
 * [Day 17](https://adventofcode.com/2018/day/17): –[](https://github.com/FlorianCassayre/AdventOfCode-2018/blob/master/src/main/scala/adventofcode/solutions/Day17.scala)

input/14.txt

@@ -0,0 +1 @@
+409551

output/14A.txt

@@ -0,0 +1 @@
+1631191756

output/14B.txt

@@ -0,0 +1 @@
+20219475

src/main/scala/adventofcode/solutions/Day14.scala

@@ -0,0 +1,31 @@
+package adventofcode.solutions
+
+import adventofcode.Day
+
+object Day14 extends Day(14) {
+
+  val inputSeq = input.map(_.asDigit)
+
+  val ten = 10
+
+  def recipes(list: Vector[Int] = Vector(3, 7), a: Int = 0, b: Int = 1, i: Int = input.toInt, reverse: Boolean): Seq[Int] = {
+    if(reverse && list.slice(list.size - input.length, list.size) == inputSeq)
+      list.dropRight(input.length)
+    else if(reverse && list.slice(list.size - input.length - 1, list.size - 1) == inputSeq)
+      list.dropRight(input.length + 1)
+    else {
+      if (reverse || !reverse && list.size - ten <= i) {
+        val newList = list ++ (list(a) + list(b)).toString.map(_.asDigit)
+        recipes(newList, (a + newList(a) + 1) % newList.size, (b + newList(b) + 1) % newList.size, i, reverse)
+      } else {
+        list.slice(i, i + ten)
+      }
+    }
+  }
+
+  override def solutionA = recipes(reverse = false).mkString
+
+  override def solutionB = recipes(reverse = true).size
+
+  submit()
+}