Recursion clear solution for The Greatest Common Divisor by MrPod - python coding challenges - Py.CheckiO

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Recursion solution in Clear category for The Greatest Common Divisor by MrPod

def greatest_common_divisor(*args):
    a, g = list(args), __import__('math').gcd
    return greatest_common_divisor(g(*a[:2]), *a[2:]) if len(a) > 2 else g(*a)

Aug. 9, 2018

0

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.