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

1 vote160 views1 answer
C++ insert variable into string
C++
1 vote180 views1 answer
C++ check if cin didn't get int
C++
1 vote175 views1 answer
Vector with pinter cout c++
C++
8 votes175 views4 answers
C++ max and min of vector
C++
2 votes177 views1 answer
Dangling Pointer in cpp
C++
0 vote162 views1 answer
Unpack tuple c++
C++
0 vote174 views1 answer
What is push() c++
C++
52 votes282 views4 answers
Remove first element from vector c++
C++
0 vote162 views1 answer
C++ bind port
C++
1 vote195 views1 answer
Int main() {
C++