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 marcelina.gorzelana
import math
def greatest_common_divisor(*args):
lst = []
for a in args:
lst.append(a)
res = math.gcd(lst[0], lst[1])
if len(lst) > 2:
for i in range(2, len(lst)):
res = math.gcd(res, lst[i])
if res == 1:
break
return res
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. 8, 2016