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 jcg
def greatest_common_divisor(*args):
"""
Find the greatest common divisor
"""
if len(args) == 2:
a, b = args
while b != 0 :
a, b = b, a%b
return a
else:
return greatest_common_divisor(args[0], greatest_common_divisor(*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"
Aug. 27, 2014
Comments:
