q = 10 // 3    #Quotient
mod = 10 % 3   #Rest
q, mod = divmod(10, 3)    #Ware und Rest gleichzeitig

a, b = b, a

def gcd(a, n):
    if n == 0:
        return  a
    else:
        return gcd(n, a % n)

Recommended Posts