Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
For any number of numbers with sorted() solution in Clear category for The Greatest Common Divisor by bravebug
def greatest_common_divisor(*args):
nums = sorted(list(set(args)))
while len(nums) - 1:
for n in range(1, len(nums)):
nums[n] = nums[n] % nums[0]
nums = sorted(list(set(nums) - {0}))
return nums[0]
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"
May 29, 2020
