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 Krzysztof_bonczyk
def nwd(a,b):
while b != 0:
(a, b) = (b, a % b)
return a
def greatest_common_divisor(*args):
a=args[0]
for i in range(1,len(args)):
b=args[i]
a=nwd(a,b)
return 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"
Dec. 3, 2016
