X问题
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8706 Accepted Submission(s): 3151
Problem Description
求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)。
Input
输入数据的第一行为一个正整数T,表示有T组测试数据。每组测试数据的第一行为两个正整数N,M (0 < N <= 1000,000,000 , 0 < M <= 10),表示X小于等于N,数组a和b中各有M个元素。接下来两行,每行各有M个正整数,分别为a和b中的元素。
Output
对应每一组输入,在独立一行中输出一个正整数,表示满足条件的X的个数。
Sample Input
3 10 3 1 2 3 0 1 2 100 7 3 4 5 6 7 8 9 1 2 3 4 5 6 7 10000 10 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9
Sample Output
1 0 3
Author
lwg
Source
HDU 2007-1 Programming Contest
Recommend
linle | We have carefully selected several similar problems for you: 1788 1695 1452 1060 1299
题解:
没啥好说的,检验你的ex中余定板子好不好用的时候到了.
细节:
1:模数m与余数b是一次性读入的。
2:输出答案为(maxx - now) / lcm ,当答案now为0时,在计算除法时已经加过一次了,要特判一下再减去。
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long LL;
const int SIZE = 20;
int n,i,fail;
LL lcm,now,k,d,x,y;
LL b[SIZE],m[SIZE];
LL exgcd(LL a,LL b,LL &x,LL &y)
{
if(!b) {x=1; y=0; return a;}
LL c=exgcd(b,a%b,x,y),z=x;
x=y; y=z-y*(a/b);
return c;
}
int t;
LL maxx;
int main()
{
cin>>t;
while(t --)
{
cin>>maxx>>n;
for(i = 0;i < n;i ++) cin>>m[i];
for(i = 0;i < n;i ++) cin>>b[i];
lcm=m[0]; now=b[0]; fail=0;
for(i=1;i<n;i++)
{
b[i]=(b[i]-now%m[i]+m[i])%m[i];
d=exgcd(lcm,m[i],x,y);
if(b[i]%d==0) k=x*(b[i]/d)%m[i]; else fail=1;
now+=k*lcm;
lcm=lcm/d*m[i];
now=(now%lcm+lcm)%lcm;
}
if(fail || now > maxx) cout<<"0\n";
else
{
LL out = (maxx - now) / lcm + 1;
if(now == 0) out --;
cout<<out<<endl;
}
}
return 0;
}