Hackerrank - Computing the GCD

Problem Statement
A description of the problem can be found on Hackerrank.

Solution
I used Euclid’s algorithm for computing Greatest Common Divisor.

I created solution in:

Scala

All solutions are also available on my GitHub.

Scala

object ComputingGcd {
    
   def gcd(x: Int, y: Int): Int =
   {
     if(y == 0) x else gcd(y, x % y)
   }
  

   /**This part handles the input/output. Do not change or modify it **/
  def acceptInputAndComputeGCD(pair:List[Int]) = {
      println(gcd(pair.head,pair.reverse.head))
  } 

    def main(args: Array[String]) {
/** The part relates to the input/output. Do not change or modify it **/
         acceptInputAndComputeGCD(readLine().trim().split(" ").map(x=>x.toInt).toList)

    }
}

object ComputingGcd {

def gcd(x: Int, y: Int): Int =

{

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

}

/**This part handles the input/output. Do not change or modify it **/

def acceptInputAndComputeGCD(pair:List[Int]) = {

println(gcd(pair.head,pair.reverse.head))

}

def main(args: Array[String]) {

/** The part relates to the input/output. Do not change or modify it **/

acceptInputAndComputeGCD(readLine().trim().split(" ").map(x=>x.toInt).toList)

}

Pavol Pidanič

I can count to 1023 with 10 fingers

Hackerrank – Computing the GCD