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 bukebuer
def greatest_common_divisor(*args):
while len(args)>1:
m = min(args)
args = [n%m for n in args if n%m and n!=m] + [m]
return args[0]
Aug. 27, 2014
Comments:
