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 vote176 views1 answer
Upcasting in c++
C++
23 votes111 views2 answers
C++ user input
C++
0 vote115 views1 answer
Fname from FString
C++
0 vote136 views1 answer
Do c++ ints neeed to be initlaized
C++
0 vote113 views4 answers
C++ to c converter
C++
12 votes116 views1 answer
Create copy constructor c++
C++
1 vote122 views1 answer
Convert whole string to lowercase c++
C++
1 vote138 views1 answer
How to round to nearest whole number unity
C++
0 vote128 views1 answer
Cpp full form
C++
0 vote123 views1 answer
C++ recorrer string
C++