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 Johny9700
def greatest_common_divisor(*args):
arg=list(args)
mini=arg[0]
for b in arg:
for a in arg:
while a%b!=0:
olda=a
oldb=b
a=oldb
b=olda%oldb
if mini>b:
mini=b
return mini
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. 24, 2016
