We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Functional Programming
  3. Ad Hoc
  4. Jumping Bunnies
  5. Discussions

Jumping Bunnies

  • franekfm
     + 0 comments

    this is well know math problem of finding Least Common Multiplication. So in scala:

    import scala.io.StdIn

object Solution {
  private def gcd(a: BigInt, b: BigInt): BigInt = {
    if (b == 0) a else gcd(b, a % b)
  }

  private def lcm(a: BigInt, b: BigInt): BigInt = {
    (a * b).abs / gcd(a, b)
  }

  private def meet(bunnies: Seq[Int]): BigInt = {
    if (bunnies.isEmpty)
      return 0
    bunnies.map(BigInt(_)).reduce(lcm)
  }

  def main(args: Array[String]): Unit = {
    StdIn.readLine()
    val bunnies = StdIn
      .readLine()
      .trim()
      .split(' ')
      .map(_.toInt)
      .toSeq
    println(meet(bunnies))
  }
}