Algoritma Euclidean Rekursif Python
def gcd(a, b):
return b if (a == 0) else gcd(b%a, a)
#contributed by rohit gupta
Frantic Fly
def gcd(a, b):
return b if (a == 0) else gcd(b%a, a)
#contributed by rohit gupta