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 vote266 views2 answers
QVariant to int
C++
2 votes245 views3 answers
Selection sort cpp
C++
0 vote249 views1 answer
Types of Triangles Based on Angles in c++
C++
0 vote263 views1 answer
C++ looping through a vector
C++
0 vote271 views1 answer
Pallindrome string
C++
1 vote261 views2 answers
C++ last element of array
C++
0 vote270 views1 answer
I++ and++i
C++
9 votes263 views4 answers
Print vector of vector c++
C++
0 vote302 views1 answer
Sort n characters in descending order c++
C++
0 vote238 views1 answer
Queue cpp
C++