Project Euler: Problem 26

euler0026.scala

def loop(numer: Int, denom: Int, digits: Seq[(Int, Int)]): Int = {
  val quot = numer / denom
  val rem = numer % denom
  val digit = (quot, rem)

  if (rem == 0) {
    0
  } else if (digits.contains(digit)) {
    digits.indexWhere(_ == digit) + 1
  } else {
    loop(rem * 10, denom, digit :: digits.toList)
  }
}

(2 until 1000).map(n => n -> loop(10, n, Nil)).maxBy(_._2)._1