Description
给出n个数a[1],…,a[n],求序列x使得sum(a[i]*x[i])=b(mod p)
Input
第一行三个整数n,p,b,第二行n个整数a[i]
(1<=n<=100,1<=p<=10000,0<=b<=p-1,a[i]< 2*10^9)
Output
如果存在满足条件的序列x则输出YES并输出x,否则输出NO
Sample Input
2 7 4
7 3
Sample Output
YES
0 6
Solution
令g=gcd(a[1],a[2],…,a[n],p),ans为答案序列,如果b不能整除g说明无解,如果能整除g说明有解,在求g的过程中由扩展欧几里得可以求得系数序列x[i],y[i]:
x[1]*a[1]+y[1]*a[2]=gcd(a[1]a[2])=g[1]
x[2]*g[1]+y[2]*a[3]=gcd(a[1],a[2],a[3])=g[2]
……
x[n-1]*g[n-1]+y[n-1]*a[n]=gcd(a[1],…,a[n])=g[n]
x[n]*g[n]+y[n]*p=gcd(a[1],a[2],…,a[n],p)=g
故有ans[i]=(b/g) * y[i-1] * x[i] * x[i+1] * … * x[n]%p
Code
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 111
int extend_gcd(int a,int b,int &x,int &y)
{
int d=a;
if(b!=0)
{
d=extend_gcd(b,a%b,y,x);
y-=(a/b)*x;
}
else
{
x=1;
y=0;
}
return d;
}
int n,a[maxn],p,b,x[maxn],y[maxn],ans[maxn];
int main()
{
scanf("%d%d%d",&n,&p,&b);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]%=p;
}
a[n+1]=p;
int g=a[1];
for(int i=1;i<=n;i++)
g=extend_gcd(g,a[i+1],x[i],y[i]);
if(b%g)printf("NO\n");
else
{
printf("YES\n");
g=b/g,y[0]=1;
for(int i=n;i>=1;i--)
{
g=(g*x[i]%p+p)%p;
ans[i]=(g*y[i-1]%p+p)%p;
}
for(int i=1;i<=n;i++)
printf("%d%c",ans[i],i==n?'\n':' ');
}
return 0;
}