Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First - The greatest common divisor solution in Clear category for The Greatest Common Divisor by AQiccl135
from fractions import gcd
def greatest_common_divisor(*args):
params = sorted(list(args), reverse=True)
result = gcd(params[0], params[1])
if len(params) > 2:
for i in range(2, len(params)):
result = gcd(params[i], result)
return result
Oct. 23, 2014
Comments:
