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

1 vote346 views1 answer
What are various sections of process
C++
0 vote326 views1 answer
Traversing a map
C++
1 vote332 views1 answer
How to easily trim a str in c++
C++
0 vote361 views1 answer
Ue4 modular character
C++
15 votes333 views3 answers
C++ string to char array
C++
0 vote368 views1 answer
Functors in c++
C++
0 vote363 views1 answer
Know what the input data is whether integer or not
C++
0 vote353 views1 answer
Cpp execute command
C++
17 votes352 views6 answers
Find max value in array c++
C++
-2 votes345 views1 answer
How to iterate through array in c++
C++