Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Greatest Common Divisor by cactusson
def greatest_common_divisor(*args):
if len(args) == 2:
return gcd(*args)
return greatest_common_divisor(gcd(*args[:2]), *args[2:])
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
April 25, 2020
Comments:
