扩展gcd

void exgcd(long long a,long long b,long long &gcd,long long &x,long long &y){  
    if(!b) gcd=a,x=1,y=0;  
    else   
        exgcd(b,a%b,gcd,y,x),  
        y-=a/b*x;  
}
bool equation(LL a, LL b, LL c, LL&x, LL&y)  //求ax+by=c中 "x" 的最小正整数解
{
	LL GCD;
	exgcd(a,b,GCD,x,y);
	if (c%GCD) return 0;
	x*=c/GCD;
	GCD=abs(b/GCD);
	x=(x%GCD+GCD)%GCD;
	return 1;
}