欧几里的定理(辗转相除法):
gcd(a,b) = gcd(b,a%b) gcd(a,b)表示a,b的最大公约数
证明:
设 a > b c = a%b
a = k * b + c (k为某个整数)
情况1:若 c为 b的约数 即 b%c == 0,则c为a,b的最大公约数
a%c = (k * b+c)%c = (k * b)%c + c%c = 0
情况2:若c不为b的约数,即 b%c = d (d为某个整数)
1)d为c的约数则,d为 b,c最大公约数,即为a b最大公约数
2) d不为c的约数则 c%d = q(q,为某个整数)
…
从情况1,情况2来看是否一直重复1,2情况,直至 gcd(a,b )中 b为0 时, a为最大公约数
证毕
常见用法:
当 b = 0 时 gcd(a,b) = a, a为最大公约数
当 a,b互为质数时 gcd(a,b) = 1
gcd源码如下:
int gcd(int a,int b)
{
return b != 0 ? gcd(b,a%b):a;
}
扩展欧几里得定理:
对于不全为0的a,b,必然存在整数对x,y 使得方程 a * x+b * y = gcd(a,b)
证明:
设 a > b
显然 当 b = 0 时
gcd(a,b) = a , a * x + b * y = a ,所以 x = 1 ,规定 y = 0
当 a * b != 0 时
设 a * x1 + b * y1 = gcd(a,b);
设 b * x2 + (a % b) * y2 = gcd(b,a % b)
由欧几里得定理可知:
gcd(a,b) = gcd(b,a%b)
a * x1 + b * y1 = b * x2 + (a % b) * y2 = b * x2 + (a - (a/b) * b)*y2
a * x1 + b * y1 = a * y2 + b * (x2 - (a/b) * y2)
推出
x1 = y2
y1 = x2 - (a / b) * y2
求得x1,y1的解与 x2,y2有关
源码如下
int extend_gcd(int a,int b,int &x,int & y)
{
if(b == 0)
{
x = 1;
y = 0;
return a;
}
// x,y调换传给下一次递归等价于x1 = y2
int t = extend_gcd(b,a%b,y,x);
//等价y1 = x2 -(a/b) * y2
y -= a / b * x;
return t;
}
用扩展欧几里得求 ax + by = c
因为由扩展欧几里得定理可知:
ax+by = gcd(a,b)
俩边除于gcd(a,b)
ax/gcd(a,b) + by/gcd(a,b) = 1
再同乘 c
a * x * c / gcd(a,b) + b * y * c / gcd(a,b) = c
所以
X=x * c / gcd(a,b)
Y=y * c / gcd(a,b)
aX+bY=c
poj 1601青蛙的约会
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
/*
维度线总长度为L
青蛙A、B坐标分别为 x y
青蛙A、B一次跳跃分别为 m n
问跳几次相遇
设跳ans次
(x+m * ans) % L = (y+ n * ans) %L
(x+m*ans)%L - (y+ n * ans)%L = 0
(x+ m*ans - (y+n*ans))%L = 0
(x+m*ans - y - n * ans) = K*L k为某个常数
(x-y)+(m-n)*ans-K*L = 0
(n-m)*ans + K*L = x-y
a = n - m
b = L
c = x-y
由扩展欧几里得定理可知
ax+by = gcd(a,b)
bx1+(a mod b )y1 = gcd(b,a mod b)
ax+by = bx1 + (a - (a/b)*b)y1
= ay1 + b(x1-(a/b)y1)
x = y1
y = x1 -(a/b)y1
if(c%gcd(a,b) == 0)
a*x*c/gcd(a,b) + b*x*c/gcd(a,b) = c
ans = X = x*c/gcd(a,b)
*/
ll x,y,m,n,L;
ll extends_gcd(ll a,ll b ,ll &x,ll &y)
{
if(b == 0)
{
x = 1; y = 0;
return a;
}
ll t = extends_gcd(b,a%b,y,x);
y-= a/b * x;
return t;
}
int main()
{
ll s,e,m,n,L;
while(~scanf("%lld%lld%lld%lld%lld",&s,&e,&m,&n,&L))
{
if(n<m)
{
swap(n,m);
swap(s,e);
}
ll a=n-m;
ll b=L;
ll c=s-e;
ll gcd=extends_gcd(a,b,x,y);
if(c%gcd==0)
{
x=x*c/gcd;
if(x>=0)
x=x%L;
else
x=x%L+L;
printf("%lld\n",x);
}
else printf("Impossible\n");
}
}
poj1061
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
/*
求ax+by = c
其中 b是与药物放在一边的 ,a不是
两种情况:
1 ax+by = c
2 bx+ay = c
由扩展欧几里得定理可知
ax+by = gcd(a,b)
bx1+(a mod b )y1 = gcd(b,a mod b)
ax+by = bx1 + (a - (a/b)*b)y1
= ay1 + b(x1-(a/b)y1)
x = y1
y = x1 -(a/b)y1
if(c%gcd(a,b) == 0)
a*x*c/gcd(a,b) + b*y*c/gcd(a,b) = c
ans = X = x*c/gcd(a,b)
*/
ll extends_gcd(ll a,ll b ,ll & x ,ll & y)
{
if(b == 0){
x = 1; y = 0;
return a;
}
ll t = extends_gcd(b,a%b,y,x);
y-=a/b*x;
return t;
}
void work(ll a,ll b,ll c,ll & g,ll & x, ll & y)
{
ll x0,y0;
g = extends_gcd(a,b,x0,y0);
x0 = x0*c/g;
y0 = y0*c/g;
x = (x0%(b/g)+(b/g))%(b/g);
y =(a*x-c)/b;
if(y<0) y = -y;
}
int main()
{
ll a,b,c;
while(cin >> a >> b >> c)
{
if(a == 0 && b == 0 && c ==0) break;
if(c == 0) {
printf("0 0\n");
continue;
}
ll x1,y1,x2,y2,g;
x1 = y1 = x2 = y2 = 0;
work(a,b,c,g,x1,y1);
work(b,a,c,g,x2,y2);
if(x1+y1 < x2+y2){
printf("%lld %lld\n",x1,y1);
}
else
printf("%lld %lld\n",y2,x2);
}
return 0;
}