【裴蜀定理】

裴蜀定理

定理

对于任意正整数 a, b，存在整数 s, t，使得 sa + tb = gcd(a, b)

证明

设r_i为辗转相除法的余数。r_i=r_i-2 mod r_i-1
初始r₀=a,r₁=b。
设r_n = r_n−2 − r_n−1q_n−1
则r_n-1 =r_n−3 − r_n−2q_n−2
则gcd(a,b）=r_n = r_n−2 −（r_n−3 − r_n−2q_n−2）q_n−1
直到 gcd(a, b)=sr₀+tr₁=sa+tb。

ecgcd

求s,t

思路

若已知r_n–1x’+r_ny’=gcd(r_n–1,r_n)
设x,y满足r_n-2x+r_n-1y=gcd(r_n–1,r_n)
因为gcd(r_n–1,r_n)=gcd(r_n–1,r_n)，
所以r_n–1x’+r_ny’=r_n-2x+r_n-1y
r_n=r_n-2-$\lfloor \frac{r_{n-2}}{r_{n-1}}\rfloor r_{n-1}$带入得
ax + by = bx′ + (a − $\lfloor \frac{a}{b}\rfloor$b)y′化简得
ax + by = ay’ + b(x’ − $\lfloor \frac{a}{b}\rfloor$y’)
x=y’,y=x’ − $\lfloor \frac{a}{b}\rfloor$y’

代码

int exgcd(int a, int b, int &x, int &y){
	if(b==0) {
		x=1, y=0;
		return a;
	 }
	int d=exgcd(b, a%b, x, y);
	int t=x;
	 x=y;
	 y=t-a/b*y;
	 return d;
 }

解二元一次不等式

设方程 ax + by = c 的一组解为 x = x₀, y = y₀
那么x = x₀+$\frac{b}{gcd(a,b)}$·t, y = y₀−$\frac{a}{gcd(a,b)}$·t（t 为任意整数）构成了方程所有的解。

证明

设存在另外一组解ax + by = c，与 ax₀ + by₀ = c
相减得a(x − x₀) = b(y₀ − y)
$\frac{a}{gcd(a,b)}$(x-x₀)=$\frac{b}{gcd(a,b)}$(y₀-y)
$\frac{a}{gcd(a,b)}$|y_o-y , $\frac{b}{gcd(a,b)}$|x-x₀
x=x₀+$\frac{b}{gcd(a,b)}$·t , y = y₀−$\frac{a}{gcd(a,b)}$·t

*当且仅当c mod gcd(a,b)=0时有整数解

应用

五指山(来源NEFU 84)

题目描述

大圣在佛祖的手掌中。
我们假设佛祖的手掌是一个圆圈，圆圈的长为 n，逆时针记为：0,1,2,··· ,n-1而大圣每次飞的距离为 d。现在大圣所在的位置记为 x，而大圣想去的地方在 y。要你告诉大圣至少要飞多少次才能到达目的地。

输入格式

有多组测试数据。
第一行是一个正整数 T，表示测试数据的组数；
每组测试数据包括一行，四个非负整数，分别为如来手掌圆圈的长度 n，筋斗所能飞的距离 d，大圣的初始位置 x 和大圣想去的地方 y。
注意孙悟空的筋斗云只沿着逆时针方向翻。

输出格式

对于每组测试数据，输出一行，给出大圣最少要翻多少个筋斗云才能到达目的地。如果无论翻多少个筋斗云也不能到达，输出 Impossible。

样例

Input	Output
2 3 2 0 2 3 2 0 1	1 2

数据范围与提示

对于全部数据，2<n<10⁹,0<d<n,0<d<n,0≤x,y<n。

• 列方程x>0的最小整数解

代码

 #include<cstdio>
long long t,n,d,x,y,gcd;
long long exgcd(long long a,long long b,long long &i,long long &j){
	if(b==0){
		i=1;j=0;
		return a;
	}
	long long q,p;
	p=exgcd(b,a%b,i,j);
	q=i;
	i=j;
	j=q-a/b*j;
	return p;
}
int main(){
	long long i,j;
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld%lld%lld",&n,&d,&x,&y);
		gcd=exgcd(d,n,i,j);
		if((y-x)%gcd){
			printf("Impossible\n");
		}
		else{
			i=i*(y-x)/gcd;
			gcd=n/gcd;
			printf("%lld\n",(i%gcd+gcd)%gcd);
		}
	}
}

The Balance

Ms. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine. For example, to measure 200mg of aspirin using 300mg weights and 700mg weights, she can put one 700mg weight on the side of the medicine and three 300mg weights on the opposite side (Figure 1). Although she could put four 300mg weights on the medicine side and two 700mg weights on the other (Figure 2), she would not choose this solution because it is less convenient to use more weights.
You are asked to help her by calculating how many weights are required.

Input

The input is a sequence of datasets. A dataset is a line containing three positive integers a, b, and d separated by a space. The following relations hold: a != b, a <= 10000, b <= 10000, and d <= 50000. You may assume that it is possible to measure d mg using a combination of a mg and b mg weights. In other words, you need not consider “no solution” cases.
The end of the input is indicated by a line containing three zeros separated by a space. It is not a dataset.

Output

The output should be composed of lines, each corresponding to an input dataset (a, b, d). An output line should contain two nonnegative integers x and y separated by a space. They should satisfy the following three conditions.

• You can measure dmg using x many amg weights and y many bmg weights.
• The total number of weights (x + y) is the smallest among those pairs of nonnegative integers satisfying the previous condition.
• The total mass of weights (ax + by) is the smallest among those pairs of nonnegative integers satisfying the previous two conditions.
  No extra characters (e.g. extra spaces) should appear in the output.

Sample

Input	Output
700 300 200 500 200 300 500 200 500 275 110 330 275 110 385 648 375 4002 3 1 10000 0 0 0	1 3 1 1 1 0 0 3 1 1 49 74 3333 1

• 求|x|+|y|最小值分类讨论

代码

#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
long long exgcd(long long a,long long b,long long &X,long long &Y){
	if(b==0){
		X=1;
		Y=0;
		return a;
	}
	long long t=exgcd(b,a%b,X,Y);
	long long xi=X;
	X=Y;
	Y=xi-a/b*Y;
	return t;
}
long long ans1,ans2,A,B,C,x,y,gcd,x1,x2,k1,k2;
void check(long long o){
	long long i=abs(x+k1*o),j=abs(y-k2*o);
	if(i+j<ans1+ans2){
		ans1=i;
		ans2=j;
	}
	else if(i+j==ans1+ans2&&i*A+j*B<ans1*A+ans2*B){
		ans1=i;
		ans2=j;
	}
}
int main(){
	while(1){
		scanf("%lld%lld%lld",&A,&B,&C);
		if(C==0&&B==0&&A==0)
			break;
		gcd=exgcd(A,B,x,y);
		if(C%gcd)
			continue;
		ans1=ans2=1e9;
		x*=C/gcd;y*=C/gcd;
		k1=B/gcd;k2=A/gcd;
		x1=-x/k1;x2=y/k2;
		check(x1-1);check(x1);check(x1+1);
		check(x2-1);check(x2);check(x2+1);
		printf("%lld %lld\n",ans1,ans2);
	}
}

应该可以不用long long吧