HDU 1573
链接 : HDU 1573
题解
中国剩余定理不互质
两两合并: 先可以先找两个同余方程 设通解为N;
N=r1(mod(m1)),N=r2(mod(m2));
显然可以化为k1*m1+r1=k2*m2+r2;—>k1*m1+(-k2*m2)=r2-r1;
设a=m1,b=m2,x=k1,y=(-k2),c=r2-r1方程可写为ax+by=c;
由欧几里得解得x即可,那么将x化为原方程的最小正整数解,(x*(c/d)%(b/d)+(b/d))%(b/d);
这里看不懂的去看解模线性方程。那么这个x就是原方程的最小整数解。
所以N=a*(x+n*(b/d))+r1====N=(a*b/d)*n+(a*x+r1),
这里只有n为未知数所以又是一个N=(a*x+r1)(mod(a*b/d))的式子,
然后只要不断的将两个式变成一个式子,最后就能解出这个方程组的解。
code
/**
*@author : adrui
*/
//package adrui;
import java.util.*;
import static java.lang.System.*;
public class Main {
public static void main(String...args){
Scanner in = new Scanner(System.in);
long t = in.nextLong();
long[] mod = new long[15];
long[] left = new long[15];
while(t-- > 0){
long N = in.nextLong(), n = in.nextLong();
for(int i = 1; i <= n; ++i) mod[i] = in.nextLong();
for(int i = 1; i <= n; ++i) left[i] = in.nextLong();
long modNum = mod[1], leftNum = left[1];
long[] x = new long[1];
long[] y = new long[1];
boolean f = true;
for(int i = 2; i <= n; ++i){
long gcd = expgcd(modNum, mod[i], x, y);
long c = left[i] - leftNum;
if(c % gcd != 0){f = false; break;}/**判断是否有解*/
x[0] *= c / gcd;
long t1 = modNum, t2 = mod[i] / gcd;
x[0] = (x[0] % t2 + t2) % t2;
modNum = t1 * t2;//模数
leftNum = ((leftNum + t1 * x[0]) % modNum + modNum) % modNum;//余数合并
}
long ans = 0;
if(f){
if(leftNum <= N) ++ans;
ans += (N - leftNum) / modNum;
if(leftNum == 0) --ans;/**排0...*/
}
out.println(ans);
}
in.close();
}
public static long expgcd(long a, long b, long[] x, long[] y) {
if(b == 0){
x[0] = 1;
y[0] = 0;
return a;
}
long d = expgcd(b, a % b, y, x);
y[0] -= a / b * x[0];
return d;
}
}