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 Pavellver
def gcd_of_two(a, b):
while a and b:
if a > b:
a = a % b
else:
b = b % a
return a + b
def greatest_common_divisor(*args: int) -> int:
nums = {*args}
result = max(nums)
for i in nums:
a = gcd_of_two(result, i)
result = min(result, a)
return result
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!")
March 18, 2023
Comments:
