Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Creative category for The Greatest Common Divisor by Albert.Nowak
def reduce(function, iterable, initializer=None):
it = iter(iterable)
if initializer is None:
try:
initializer = next(it)
except StopIteration:
raise TypeError('reduce() of empty sequence with no initial value')
accum_value = initializer
for x in it:
accum_value = function(accum_value, x)
return accum_value
def NWD(a,b):
if b==0:
return a
else:
return NWD(b,a%b)
def greatest_common_divisor(*args):
return reduce(NWD,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. 3, 2016
