传送门:
http://poj.org/problem?id=2065
sol:
同余意义下解方程,除法变成逆元即可
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
typedef long long ll;
typedef double s64;
int n,m;
inline int read()
{
char c;
int res,flag=0;
while((c=getchar())>'9'||c<'0') if(c=='-')flag=1;
res=c-'0';
while((c=getchar())>='0'&&c<='9') res=(res<<3)+(res<<1)+c-'0';
return flag?-res:res;
}
const int N=310;
char sr[N];
int c[N][N];
int pyz=7;
inline int ksm(int s,int t)
{
int res=1;
while(t)
{
if(t&1) res=res*s%pyz;
s=s*s%pyz;
t>>=1;
}
return res;
}
int ans;
inline void debug()
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
printf("%d ",c[i][j]);
printf("\n");
}
printf("\n");
}
inline void guass()
{
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
c[i][j]%=pyz;
for(int i=1;i<=n;++i)
{
int row;
for(row=i;row<=n;++row) if(c[row][i]) break;
if(row>n)
{
ans=1;
continue;
}
if(row!=i)
for(int j=1;j<=m;++j) swap(c[row][j],c[i][j]);
int inv=ksm(c[i][i],pyz-2);
for(int j=1;j<=m;++j) c[i][j]=c[i][j]*inv%pyz;
for(int j=1;j<=n;++j)
if(c[j][i]&&i!=j)
{
int tmp=c[j][i];
for(int k=1;k<=m;++k)
c[j][k]=(c[j][k]-c[i][k]*tmp%pyz+pyz)%pyz;
}
// debug();
}
for(int i=1;i<m;++i)
if(!c[i][i])
{
if(c[i][m])
{
ans=-1;
return;
}
ans=1;
}
}
inline void solve()
{
pyz=read();
scanf("%s",sr+1);
n=strlen(sr+1);
m=n+1;
memset(c,0,sizeof(c));
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
c[i][j]=ksm(i,j-1);
if('a'<=sr[i]&&sr[i]<='z')
c[i][m]=(sr[i]-'a'+1)%pyz;
}
guass();
for(int i=1;i<=n;++i)
printf("%d ",c[i][m]);
printf("\n");
}
int main()
{
// freopen("2065.in","r",stdin);
// freopen(".out","w",stdout);
int T=read();
while(T--) solve();
}