hdu1753 X问题
原题地址:http://acm.hdu.edu.cn/showproblem.php?pid=1573
题意:
T组数据,
求在小于等于N的正整数中有多少个X满足:
X mod a[0] = b[0],
X mod a[1] = b[1],
X mod a[2] = b[2],
…
X mod a[M] = b[M]…
数据范围
0 < a[i] <= 10,0 < N <= 1000,000,000 , 0 < M <= 10
题解:
扩展中国剩余定理。
如何合并两个同余方程?
x=m1k1+a1
x
=
m
1
k
1
+
a
1
x=m2k1+a2
x
=
m
2
k
1
+
a
2
m1k1+a1=m2k2+a2
m
1
k
1
+
a
1
=
m
2
k
2
+
a
2
(m1k1−m2k2)=a2−a1
(
m
1
k
1
−
m
2
k
2
)
=
a
2
−
a
1
m1k1≡(a2−a1) (mod m2)
m
1
k
1
≡
(
a
2
−
a
1
)
(
m
o
d
m
2
)
gcd(m1,m2)∤(a2−a1) g c d ( m 1 , m 2 ) ∤ ( a 2 − a 1 ) 时无解
令 gcd(m1,m2)=d g c d ( m 1 , m 2 ) = d , a2−a1=c a 2 − a 1 = c
则
m1dk1≡cd mod(m2d)
m
1
d
k
1
≡
c
d
m
o
d
(
m
2
d
)
k1≡cd∗(m1d)−1 mod(m2d)
k
1
≡
c
d
∗
(
m
1
d
)
−
1
m
o
d
(
m
2
d
)
令
k=cd∗(m1d)−1
k
=
c
d
∗
(
m
1
d
)
−
1
则
k1=m2d∗y+k
k
1
=
m
2
d
∗
y
+
k
于是 x=m1∗(m2d∗y+k)+a1=m1m2d∗y+m1∗k+a1 x = m 1 ∗ ( m 2 d ∗ y + k ) + a 1 = m 1 m 2 d ∗ y + m 1 ∗ k + a 1
合并为 x≡m1∗k+a1 mod(m1m2d) x ≡ m 1 ∗ k + a 1 m o d ( m 1 m 2 d ) ,其中 k=(m1d)−1 k = ( m 1 d ) − 1
代码:
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
const int N=20;
int a[N],b[N],n,m,T;
bool flag;
int getgcd(int A,int B) {return B==0?A:getgcd(B,A%B);}
void exgcd(int A,int B,int &x,int &y)
{
if(B==0) {x=1; y=0; return;}
int x0,y0;
exgcd(B,A%B,x0,y0);
x=y0;
y=x0-(A/B)*y0;
}
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
int a1=b[1]; int m1=a[1]; int a2,m2; flag=0;
for(int i=2;i<=m;i++)
{
a2=b[i]; m2=a[i]; if(a2<a1) {swap(a1,a2); swap(m1,m2);}
int c=a2-a1; int d=getgcd(m1,m2);
if(c%d) {flag=1;break;}
int x,y; exgcd(m1/d,m2/d,x,y);
x=(x+(m2/d))%(m2/d); x=(x*(c/d)+(m2/d))%(m2/d);
a1=m1*x+a1; m1=(m1*m2)/d;
}
if(flag||a1>n) printf("%d\n",0);
else if(a1==0) printf("%d\n",(n-a1)/m1);
else printf("%d\n",(n-a1)/m1+1);
}
return 0;
}