d为a,b的最大公因数,x为a(mod)b的逆元:
void Gcd( LL a , LL b , LL &d , LL &x , LL &y )
{
if ( b==0 ){ d = a; x = 1; y = 0; }
else{ Gcd( b , a%b , d , y , x ); y = y-x*(a/b); }
}
d为a,b的最大公因数,x为a(mod)b的逆元:
void Gcd( LL a , LL b , LL &d , LL &x , LL &y )
{
if ( b==0 ){ d = a; x = 1; y = 0; }
else{ Gcd( b , a%b , d , y , x ); y = y-x*(a/b); }
}