Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution. 

The inputs `x` and `y` are always greater or equal to 1, so the greatest common divisor will always be an integer that is also greater or equal to 1.

Difficulty: introductory

Starter code:

def mygcd(x,y):
	

Solutions:
#Try to make your own gcd method without importing stuff
def mygcd(x,y):
    #GOOD LUCK
    while y:
        x,y=y,x%y
    return x

def mygcd(x,y):
  return x if y == 0 else mygcd(y, x % y)


def mygcd(x,y):
    if x%y == 0:
        return y
    else:
        return mygcd(y,x%y)

# reference: http://en.wikipedia.org/wiki/Euclidean_algorithm
# Please note that it does not matter if y is larger than x, because x%y will have value x
# which is passed to variable y in the next iteration. So the number of iterations is only
# increased by one, but the solution will still be correct.


def mygcd(x,y):
    return x if not y else mygcd(y, x%y)

def mygcd(x, y):
    while y>0:
        x, y = y, x%y
    return(x)

def mygcd(x,y):
    if x == 0:
        return y
    if y == 0:
        return x
    else:
        return mygcd(y, x%y)

def mygcd(x,y):
    """Euclidean algorithm."""
    reminder = x%y
    if reminder == 0:
        return y
    else:
        return mygcd(y,reminder)

def mygcd(a,b):
    while b > 0:
        a, b = b, a % b
    return a

#Try to make your own gcd method without importing stuff
def mygcd(a,b):
    if b == 0:
        return a
    else:
        return mygcd(b, a % b)