计算Ax+By=C
如果C是gcd(A,B)的整数倍,就有解,否则无解
你用扩展欧几里得,计算上述公式,只需计算A1 x+B1 y=1; A1=A/gcd(A,B),B1=B/gcd(A,B);
最后在把x扩大C/gcd(A,B)倍。x可能是负数,如果要求正数,可以扩充解系,我们需要将(A’,B’,x’,y’)扩充为一个解系。
由于A’B’是互质的,所以可以将A’x’+B’y’=1扩展为:
A'x'+B'y'+(u+(-u))A'B'=1
=> (x’ + uB’)*A’ + (y’ - uA’)*B’ = 1
=> X = x’ + uB’, Y = y’ - uA’
#include<bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define fastIO ios::sync_with_stdio(false);cin.tie(0);
#define LL long long
#define pb push_back
#define gcd __gcd
#define For(i,j,k) for(int i=(j);i<k;i++)
#define lowbit(i) (i&(-i))
#define _(x) printf("%d\n",x)
const double EPS = 1e-8;
const int maxn = 1e6+10;
const int inf = 1 << 28;
void gcd(LL a,LL b,LL&d,LL&x,LL&y){
if(!b){d=a;x=1;y=0;}
else {gcd(b,a%b,d,y,x); y-=x*(a/b);}
}
int main(){
LL s1,s2,v1,v2,m;
cin>>s1>>s2>>v1>>v2>>m;
LL A = v1-v2;
LL B = m;
LL C = s2-s1;
if(A<0)A+=m;
LL x,y,d = gcd(A,B);
if(C % d){
puts("-1");return 0;
}
A/=d;B/=d;C/=d;
gcd(A,B,d,x,y);
x = (C * x) % B;
while(x<0)x+=B;
cout<<x<<endl;
return 0;
}