题目:
分析:
不妨设它们 一共跳了t次,则有:(x+m*t) % L = (y+n*t) % L,即:
于是便可以套用扩展欧几里得算法求解
代码:
#include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
void ex_gcd(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x = 1;
y = 0;
return;
}
ex_gcd(b,a%b,x,y);
ll t = x;
x = y;
y = t-a/b*y;
}
int main()
{
ll x,y,m,n,L,xx,yy; //x为上文中t,y为d
cin>>xx>>yy>>m>>n>>L;
ll c = yy-xx;
ll a = m-n;
ll b = L;
if(c%__gcd(a,b)!=0)
cout<<"Impossible";
else
{
ll g = __gcd(a,b);
ex_gcd(a,b,x,y);
x = x*c/g;
ll s = b/g;
if(s<0) s = -s;
cout<<(x%s+s)%s;
}
return 0;
}
总结:
今天总算学完了exgcd!!!
求解二元一次方程 ax + by = gcd(a,b)
(1)根据gcd(a,b) = gcd(b,a%b) 和 a%b = a - a/b*b
设 ax1+by1 = gcd(a,b) = gcd(b,a%b) = bx2+(a%b)y2
解得 x1=y2 , y1=x2-a/b*y2
又因为最后b = 0时,x2 = 1,y2 = 0;于是回溯解得x1,y1
通解 x = x1+b*t , y = y1-a*t ,其中 t 为整数 ,g = gcd(a,b)
(2)求最小正整数解
根据通解不难发现,令 mod = b,最小正整数解 x = (x%mod+mod)%mod
若b<0,b = -b,这样上式依然能求得最小正整数解,因为 t 可正可负
(3)求解 ax + by = c 时,若 gcd(a,b) 整除 c 时才存在整数解,否则无解(贝祖定理) ,
先求解ax + by = gcd(a,b),左右两边同时乘以 c/g 得到原方程
所以x1 = x1*c/g,y1 = y1*c/g,通解x = x1 + b/g*t,y = y1-a/g*t,求最小正整数解 x 时,令 mod = b/g 即可
(4)扩欧裸题~~
ps:扩展欧几里得算法详解