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 Ambulanss
def gcd(a, b):
while b:
a, b = b, a%b
return a
def greatest_common_divisor(*args):
output = args[0]
i = 1
while i < len(args):
output=gcd(output, args[i])
i+=1
"""
Find the greatest common divisor
"""
return output
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"
Nov. 13, 2016
