Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for The Greatest Common Divisor by UFO665
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def greatest_common_divisor(*args):
res = args[0]
for i in range(1, len(args)):
res = gcd(res, args[i])
return res
Jan. 31, 2016
