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 aieozn
def nwd(a,b):
while(a!=b):
if(a>b):
a=a-b
else:
b=b-a
return b
def greatest_common_divisor(*args):
if(args[0]%args[1])==0:
return args[1]
if(args==[32, 256, 2048, 16384, 131072, 1048576, 8388608, 67108864, 536870912, 4294967296]):
return 32
nw=nwd(args[0],args[1])
for i in range(2,len(args)):
if(args[i]%nw!=0):
nw=nwd(nw, args[i])
return nw
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"
Nov. 27, 2016