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

0 vote137 views1 answer
C++ CHEAT SHEAT
C++
0 vote122 views1 answer
Destin'y child
C++
0 vote130 views1 answer
Abstraction in cpp
C++
0 vote132 views2 answers
What do you mean by smallest anagram of a string
C++
1 vote153 views1 answer
Retourner pointeur de type qstringlist qt
C++
0 vote155 views1 answer
Compile and run cpp file on mac c++
C++
0 vote142 views1 answer
Bounded and unbounded solution in lpp
C++
1 vote140 views1 answer
Compile multiple files C++ linux
C++
1 vote138 views1 answer
Explicit vs implicit c++
C++
0 vote143 views1 answer
What is blob in computer vision
C++