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 vote171 views1 answer
C++ initialize size of 3d vector
C++
7 votes171 views5 answers
Stack c++
C++
1 vote157 views1 answer
What is time complexity of min_element()
C++
0 vote156 views1 answer
Create new node in tree
C++
0 vote165 views3 answers
C++ tuple
C++
0 vote151 views1 answer
How togreper
C++
0 vote152 views1 answer
Split a number and store it in vector
C++
0 vote181 views1 answer
Find first of a grammar
C++
1 vote182 views2 answers
C++ code for selection sort
C++
0 vote171 views4 answers
C++ sort vector of objects by property
C++