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 dcreekp
def greatest_common_divisor(*args):
"""
Find the greatest common divisor
"""
def gcd(a, b):
if a % b != 0:
return gcd(b, a % b)
else:
return b
args = list(args)
while len(args) > 2:
args = [gcd(args[0], args[1])] + args[2:]
else:
return gcd(args[0],args[1])
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert greatest_common_divisor(6, 4) == 2, "Simple"
assert greatest_common_divisor(2, 4, 8) == 2, "Three arguments"
assert greatest_common_divisor(2, 3, 5, 7, 11) == 1, "Prime numbers"
assert greatest_common_divisor(3, 9, 3, 9) == 3, "Repeating arguments"
March 6, 2015
