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 vote183 views1 answer
Operators on strings c++
C++
1 vote186 views1 answer
What does the modularity mean in c++
C++
10 votes210 views2 answers
2d vector c++ declaration
C++
7 votes169 views1 answer
How to make string get spaces c++
C++
0 vote231 views1 answer
Get rid of those includes c++
C++
-1 vote184 views1 answer
C++ pwstr to char*
C++
0 vote196 views1 answer
Advanced c++ topics
C++
0 vote176 views1 answer
How to store pair in min heap in c++
C++
3 votes184 views3 answers
Find an element in vector of pair c++
C++
0 vote185 views1 answer
C++ program to find gcd of 3 numbers
C++