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 vote676 views1 answer
Cpp class access array member by different name
C++
0 vote221 views1 answer
Foo foo little dogs
C++
0 vote182 views1 answer
Program To Calculate Number Power Using Recursion In C++. The power number should always be positive integer.
C++
0 vote190 views1 answer
How to use comparitor in priority queu in c++
C++
4 votes215 views3 answers
GCD in cpp
C++
0 vote218 views1 answer
How to run a msi file raspbrain
C++
0 vote212 views1 answer
Imports the elements in the array c++
C++
1 vote200 views1 answer
Login system with c++
C++
0 vote280 views1 answer
New expression
C++
4 votes292 views1 answer
Arduino uno hello world
C++