X问题
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5621 Accepted Submission(s): 1919
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
做了几道发现扩展欧几里得的简单题貌似就是这个套路了- -
要注意的就是判断,是否满足a*x+b*y=c中的c是gcd(a, b)的倍数,不满足则输出0,最后还要注意一下最小整数解是否大于给定的N,以及是否为0,题目要求正整数,舍去0即可
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<functional>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define CL(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e5+10;
const int MOD = 1e9+7;
int n[20], m[20];
void ex_gcd(int a, int b, int& d, int& x, int& y){
if(!b){
d = a;
x = 1;
y = 0;
}
else{
ex_gcd(b, a%b, d, y, x);
y -= x*(a/b);
}
}
int main(){
int T, d, x, y, m1, m2, m3, n1, n2, n3, v, N, M;
int kcase = 1;
scanf("%d", &T);
while(T--){
scanf("%d%d", &N, &M);
for(int i = 1; i <= M; i++) scanf("%d", &m[i]);
for(int i = 1; i <= M; i++) scanf("%d", &n[i]);
m1 = m[1]; n1 = n[1];
bool flag = false;
for(int i = 2; i <= M; i++){
m2 = m[i]; n2 = n[i];
ex_gcd(m1, m2, d, x, y);
LL c, t, k;
c = n2-n1;
if(c % d){
flag = true;
break;
}
c /= d;
t = m2/d;
x *= c;
k = (x%t+t)%t;
n1 += m1*k;
m1 = m1/d*m2;
n1 = (n1%m1+m1)%m1;
}
if(flag || n1 > N) printf("0\n");
else{
if(!n1) printf("%d\n", N/m1);
else printf("%d\n", (N-n1)/m1 + 1);
}
}
return 0;
}