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 rogos
# migrated from python 2.7
from functools import reduce
def gcd(a, b):
if b > a:
a, b = b, a
if b == 0:
return a
return gcd(b, a%b)
def greatest_common_divisor(*args):
return reduce(gcd, args)
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"
Jan. 31, 2017
