Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
2-liner solution in Clear category for The Greatest Common Divisor by przemyslaw.daniel
def greatest_common_divisor(*a):
return __import__('fractions').gcd(a[0], greatest_common_divisor(*a[1:])) if len(a) > 1 else a[0]
Feb. 8, 2017