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 vote245 views1 answer
Ampersand in cpp
C++
1 vote249 views2 answers
Struct constructor in c++
C++
0 vote257 views1 answer
Extra parameter in comparator function for sort
C++
0 vote249 views1 answer
Declaring array of int
C++
5 votes260 views2 answers
Time measurement c++
C++
-1 vote236 views2 answers
Run cpp code
C++
-1 vote274 views5 answers
Memset in c++
C++
0 vote274 views1 answer
Vector of threads thread pool c++
C++
0 vote250 views1 answer
C++ find with predicat
C++
1 vote257 views1 answer
Cpp map iterate over keys
C++