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:

All solutions are also available on my GitHub.

Scala