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

4 votes103 views3 answers
Count set bits in an integer c++
C++
2 votes120 views2 answers
Hide terminal window c++
C++
0 vote106 views1 answer
C++ iterate over vector of pointers
C++
0 vote96 views1 answer
Take single digit integer input in c++
C++
0 vote111 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote95 views1 answer
How to read rotary encoder c++
C++
0 vote71 views1 answer
How to print hex of char c++
C++
0 vote105 views1 answer
How to block the screen c++
C++
-1 vote108 views2 answers
C++ to mips assembly converter
C++
1 vote98 views1 answer
C++ find in pair
C++