个人笔记不喜勿喷
算法的模拟运行过程
一段好理解一点的扩展欧几里得算法
int exGcd(int a, int b, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
return a;
}
int r = exGcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return r;
}
//来自 https://xuanwo.org/2015/03/11/number-theory-gcd/