代码较简短
// ret value which is gcd(a, b)
// x is coefficient of a
// y is coefficient of b
void ex_gcd(LL a, LL b, LL &r, LL &x, LL &y) {
if (!b) {r = a, x = 1, y = 0;}
else {
ex_gcd(b, a % b, r, y, x);
y -= x * (a / b);
}
}
使用这个函数可以求解形如ax + by = gcd(a, b)方程的x和y整数解。
注意:这个gcd函数假设了b不为0,b如果为0会出现除以0的错误。另外,a如果为0,结果也将不正确。
/* ax + by = gcd(a, b) */
/* x = xpp - q * xp */
/* y = ypp - q * yp */
/* xpp 表示 x pre pre, 即x(n - 2), 其余同理 */
LL ex_gcd(LL a, LL b, LL &x, LL &y) {
LL xp, xpp, yp, ypp;
LL r, q;
q = a / b, r = a % b;
xpp = x = 0, ypp = y = 1;
if (!r) return b;
xp = x = 1, yp = y = -q;
while (true) {
a = b, b = r;
q = a / b, r = a % b;
if (!r) return b;
x = xpp - xp * q;
y = ypp - yp * q;
xpp = xp, ypp = yp;
xp = x, yp = y;
}
}