题意:
(a0 * 10 + a1 * 11 + ... an-1 * 1n-1) % P = C1
(a0 * 20 + a1 * 21 + ... an-1 * 2n-1) % P = C2
(a0 * 30 + a1 * 31 + ... an-1 * 3n-1) % P = C3
....
(a0 * n0 + a1 * n1 + ... an-1 * nn-1) % P = Cn
给定n个以上的方程组,求满足条件的 ai (0 <= i < n),Ci = chr[i]!='*'?chr[i]-'a'+1:0 (0 <=i < n)
思路:
因为是构成范德蒙德行列式,所以有且仅有唯一解。
然后就是求解x[i]的时候 会涉及到,a[i][i]*x[i]=tep(mod p),则需要用拓展欧几里得求解
#include"cstdlib"
#include"cstdio"
#include"cstring"
#include"cmath"
#include"queue"
#include"algorithm"
#include"iostream"
using namespace std;
int a[75][75];
int equ,var;
int x[75];
int nofree_num;
int ans;
void debug()
{
for(int i=0; i<equ; i++)
{
for(int j=0; j<=var; j++) printf("%d ",a[i][j]);
puts("");
}
puts("");
}
void build(int n,int p)
{
int i,j;
for(i=0; i<n; i++)
{
int t=1;
for(j=0; j<n; j++,t*=(i+1))
{
t%=p;
a[i][j]=t;
a[i][j]%=p;
}
}
}
int gcd(int x,int y)
{
return y?gcd(y,x%y):x;
}
int lcm(int x,int y)
{
return x/gcd(x,y)*y;
}
int exgcd(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int r=exgcd(b,a%b,x,y);
int t;
t=x;
x=y;
y=t-a/b*y;
return r;
}
void gauss(int p)
{
int i,j;
int row,col;
for(row=0,col=0; row<equ&&col<var; row++,col++)
{
int maxr=row;
for(i=row+1; i<equ; i++) if(abs(a[i][col])>abs(a[maxr][col])) maxr=i;
if(a[maxr][col]==0)
{
row--;
continue;
}
for(i=0; i<=var; i++) swap(a[row][i],a[maxr][i]);
for(i=row+1; i<equ; i++)
{
if(a[i][col])
{
int LCM=lcm(abs(a[row][col]),abs(a[i][col]));
int ta=LCM/abs(a[row][col]);
int tb=LCM/abs(a[i][col]);
if(a[i][col]*a[row][col]<0) ta=-ta;
for(j=col; j<=var; j++)
a[i][j]=((a[i][j]*tb)%p-(a[row][j]*ta)%p+p)%p;
}
}
}
for(i=row-1; i>=0; i--)
{
int tep=a[i][var]%p;
int xx,yy,s;
for(j=i+1; j<var; j++)
tep=(tep%p-(x[j]*a[i][j])%p+p)%p;
int GCD=exgcd(a[i][i],p,xx,yy);
xx=xx*(tep/GCD);
s=p/GCD;
x[i]=(xx%s+s)%s;
}
for(i=0;i<var;i++)
{
if(i==var-1) printf("%d\n",x[i]);
else printf("%d ",x[i]);
}
return ;
}
int main()
{
int t;
cin>>t;
while(t--)
{
int p,n;
char v[123];
cin>>p>>v;
n=strlen(v);
equ=var=n;
memset(a,0,sizeof(a));
build(n,p);
for(int i=0; v[i]; i++)
{
if(v[i]!='*') a[i][var]=v[i]-'a'+1;
else a[i][var]=0;
}
gauss(p);
}
}