Hackerrank - Jumping Bunnies

Hackerrank – Problem Statement

A description of the problem can be found on Hackerrank.

Solution

Calculate the Least Common Multiple of bunnies jumps.

I created solution in:

Scala

All solutions are also available on my GitHub.

Scala

import scala.io.Source

object JumpingBunnies extends App {
  val lines = Source.stdin.getLines().toList
  val bunnies = lines(1).split(" ").map(_.toInt)

  val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

  println(commonPoint)

  def gcd(x: BigInt, y: BigInt): BigInt = {
    if(y == 0) x else gcd(y, x % y)
  }

  def lcm(x: BigInt, y: BigInt): BigInt = {
    (x * y) / gcd(x, y)
  }
}

import scala.io.Source

object JumpingBunnies extends App {

val lines = Source.stdin.getLines().toList

val bunnies = lines(1).split(" ").map(_.toInt)

val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

println(commonPoint)

def gcd(x: BigInt, y: BigInt): BigInt = {

if(y == 0) x else gcd(y, x % y)

}

def lcm(x: BigInt, y: BigInt): BigInt = {

(x * y) / gcd(x, y)

}

Pavol Pidanič

I can count to 1023 with 10 fingers

Hackerrank – Jumping Bunnies

Hackerrank – Problem Statement

Solution

Leave a Reply Cancel reply