Extended euclidean algorithm

Extended euclidean python

def extendEuclidean(a, b, s1=1, s2=0, t1=0, t2=1):
    
    if b:
        r=a%b
        return extendEuclidean(b, r, s2, s1-s2*(a//b), t2, t1-t2*(a//b))
    
    return a, s1, t1

Extended euclidean algorithm

int gcd(int a, int b, int& x, int& y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int x1, y1;
    int d = gcd(b, a % b, x1, y1);
    x = y1;
    y = x1 - y1 * (a / b);
    return d;
}

Source: cp-algorithms.com

Similar codes

2 votes158 views1 answer
Insert element in array c++
C++
7 votes160 views3 answers
How to use sleep function in c++ windows
C++
0 vote163 views1 answer
GlUniform bool
C++
-2 votes151 views6 answers
Array in c++
C++
0 vote183 views1 answer
Cpp map contains
C++
0 vote172 views1 answer
C++ freecodecamp course 10 hours youtube
C++
0 vote226 views1 answer
C++ functions dynamic vector
C++
1 vote180 views1 answer
How to compare two char* in c++
C++
0 vote165 views1 answer
Shell-Sort C++
C++
0 vote177 views1 answer
C++ if bool true
C++