题目链接
题目:
题目大意:给两个数字n,m分别代表a,b两个序列的长度,对于b序列的每一个元素(bj,j∈[1,m]),求GCD(a1+bj,a2+bj,…,an+bj)
解题思路:由gcd(a,b)=gcd(a,a-b)=gcd(b,a-b)化简原式子可得GCD(a1+bj,a2+bj,…,an+bj)就是GCD(a1+bj,a2-a1,a3-a1,…,an-a1),那么只要先求出a2-a1,a3-a1,…an-a1这些数的gcd,最后注意a2-a1,a3-a1,…an-a1中某些数可能为负,处理一下即可
解题代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 2e5+5;
ll a[MAX_N] , b[MAX_N];
int main()
{
int n , m;
scanf("%d%d",&n,&m);
for(int i = 1 ; i <= n ; ++i)
scanf("%lld",&a[i]);
for(int i = 1 ; i <= m ; ++i)
scanf("%lld",&b[i]);
if(n == 1){
printf("%lld",a[1] + b[1]);
for(int i = 2 ; i <= m ; ++i)
printf(" %lld",abs(a[1] + b[i]));
putchar('\n');
}
else{
ll ans_1 = a[2] - a[1];
for(int i = 3 ; i <= n ; ++i)
ans_1 = __gcd(ans_1 , a[i]-a[1]);
printf("%lld",abs(__gcd(a[1]+b[1],ans_1)));
for(int i = 2 ; i <= m ; ++i)
printf(" %lld",abs(__gcd(a[1]+b[i],ans_1)));
putchar('\n');
}
return 0;
}