扩展欧几里德

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
/*
gcd(a,b)=gcd(b,a%b)
r = xa+yb = x1 *b +y1 *(a%b)

*/
/*
	 a = b * q1 +r1;
	 b = r1 * q2 + r2;
	 r1 = r2 * q3 + r3;
	 r2 = r3 * q4 + r4;

	 r(i) = r(i+1) * q(i+2) +r(i+2)
	 r(i+2) = r(i)- r(i+1)*q(i+2);
	 r(0)=b;
	 r(-1)=a;
	 y(i+2)a+u(i+2)b=y(i)*a+u(i)*b-(y(i+1)*a+u(i+1)*b)*q(i+1)
	 q = r(i-1)/r(i);
	 y(i+2)=y(i)-y(i+1)*q(i+1);
	 u(i+2)=u(i)-u(i+1)*q(i+1);
*/
pair<int, int> exgcd(int a, int b) {
	int r0 = a, y0 = 1, u0 = 0;
	int r1 = b, y1 = 0, u1 = 1;
	int r2, y2, u2;
	while(r1=a*y1+b*u1){
		auto q = r0 / r1;
		y2 = y0 - q * y1, u2 = u0 - q * u1;
		y0 = y1, u0 = u1, r0 = r1;
		y1 = y2, u1 = u2;// r1 = r2;
	}
	return { y0,u0 };
}
/*
	gcd(a,b)=gcd(b,a%b)=gcd(k,0)=k
	a*x1+b*y1=b*x2 +(a%b)*y2=(b*x2+(a-a/b*b)*y2=a*y2+b(x2-a/b*y2);
	x1=y2;
	y1=x2-a/b*y2;
*/
pair<int, int> exgcd2(int a, int b) {
	if (b == 0) {
		return {a, 0};
	}
	else {
		auto v = exgcd2(b, a % b);
		int x1 = v.second;
		int y1 = v.first - v.second * (a / b);
		return { x1,y1 };
	}
}
int main() {
	auto v = exgcd(3, 7);
	auto v2 = exgcd2(3, 7);
	cout << v.first << ' ' << v.second << endl;
	cout << v2.first << ' ' << v2.second << endl;
}