欧几里得算法和扩展欧几里得算法

 1
 实现代码：
 #include <iostream>
using namespace std;

void exgcd(long long a, long long b, long long &d, long long &x, long long &y) {
    if (b == 0) {
        d = a, x = 1, y = 0;
    }
    else {
        exgcd(b, a%b, d, y, x); y-=a/b*x;
    }
}

int main() {
    long long a, b, d, x, y;
    while (cin >> a >> b) {
        exgcd(a, b, d, x, y);
        cout << d << " " << x << " " << y << endl;
    }

}