用于扩展欧几里得算法的Python程序

# Python program to demonstrate working of extended 
# Euclidean Algorithm 
     
# function for extended Euclidean Algorithm 
def gcdExtended(a, b): 
    # Base Case 
    if a == 0 :  
        return b,0,1
             
    gcd,x1,y1 = gcdExtended(b%a, a) 
     
    # Update x and y using results of recursive 
    # call 
    x = y1 - (b//a) * x1 
    y = x1 
     
    return gcd,x,y
      
  
# Driver code
a, b = 35,15
g, x, y = gcdExtended(a, b) 
print("gcd(", a , "," , b, ") = ", g) 

输出：

gcd(35, 15) = 5

有关详细信息，请参阅有关基本和扩展欧几里得算法的完整文章！