Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
max solution in Creative category for The Greatest Common Divisor by coells
def greatest_common_divisor(*args):
a = set(args)
while a - {max(a)}:
a = a - {max(a)} | {max(a) % max(a - {max(a)})} - {0}
return max(a)
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"
Sept. 22, 2014
Comments:
