Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Lazy solution solution in Clear category for The Greatest Common Divisor by Pouf
from fractions import gcd
def greatest_common_divisor(*args):
result, *args = args
for n in args:
result = gcd(result, n)
return result
Oct. 10, 2015
Comments: