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.

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Complete search

Starter code: def mygcd(x,y):
	

Solutions:
def mygcd(x, y):
	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):
	return x if not y else mygcd(y, x % y)


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


def mygcd(a, b):
	if b == 0:
		return a
	else:
		return mygcd(b, a % b)