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

2 votes288 views3 answers
Online ide c++
C++
0 vote303 views1 answer
1162261467
C++
1 vote275 views2 answers
Pain
C++
0 vote323 views1 answer
C++ write string
C++
9 votes295 views4 answers
Max c++
C++
4 votes279 views1 answer
Git branch in my bash prompt
C++
12 votes282 views3 answers
Max element in array c++ stl
C++
1 vote294 views3 answers
On component begin overlap c++
C++
1 vote287 views1 answer
Shared_ptr header file
C++
1 vote345 views1 answer
Qt remove resize handle
C++