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 kdim
def greatest_common_divisor(*args:int) -> int:
marg = min(args)
divs = []
for i in range(int(marg**0.5), 0, -1):
if not marg % i:
divs += [i, marg/i]
for i in sorted(divs, reverse=True):
if not max([ k%i for k in args ]):
return i
if __name__ == '__main__':
print("Example:")
print(greatest_common_divisor(6, 4))
# These "asserts" are used for self-checking and not for an auto-testing
assert greatest_common_divisor(6, 4) == 2
assert greatest_common_divisor(2, 4, 8) == 2
assert greatest_common_divisor(2, 3, 5, 7, 11) == 1
assert greatest_common_divisor(3, 9, 3, 9) == 3
print("Coding complete? Click 'Check' to earn cool rewards!")
Jan. 12, 2021
