#include<cstdio>#include<cstring>usingnamespacestd;
int n,k,P,i,j;
struct M{
int a[31][31];
friend M operator*(M x,M y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
for (int k=0;k<n;k++) z.a[i][j]=(z.a[i][j]+x.a[i][k]*y.a[k][j])%P;
return z;
}
friend M operator+(M x,M y){
for (int i=0;i<n;i++)
for (int j=0;j<n;j++) x.a[i][j]=(x.a[i][j]+y.a[i][j])%P;
return x;
}
friend M operator^(M x,int y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++) z.a[i][i]=1;
for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}A,s;
M solve(int x){
if (x==1) return A;
M ans=solve(x/2);
if (x&1){
M a=A^(x/2+1);
return ans*a+ans+a;
}
return ans*(A^(x/2))+ans;
}
int main(){
while (~scanf("%d%d%d",&n,&k,&P)){
for (i=0;i<n;i++)
for (j=0;j<n;j++) scanf("%d",&A.a[i][j]);
s=solve(k);
for (i=0;i<n;i++)
for (j=0;j<n;j++) printf("%d%c",s.a[i][j],j==n-1?'\n':' ');
}
}
//https://blog.csdn.net/clover_hxy/article/details/51476556#include<bits/stdc++.h>usingnamespacestd;
int n,k,P,i,j,b,nn;
struct M{
int a[2][2];
friend M operator*(M x,M y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
for (int k=0;k<n;k++) z.a[i][j]=(z.a[i][j]+(longlong)x.a[i][k]*y.a[k][j])%P;
return z;
}
friend M operator+(M x,M y){
for (int i=0;i<n;i++)
for (int j=0;j<n;j++) x.a[i][j]=(x.a[i][j]+y.a[i][j])%P;
return x;
}
friend M operator^(M x,int y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++) z.a[i][i]=1;
for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}A,s,B,f;
M solve(int x){
if (x==1) return A;
M ans=solve(x/2);
if (x&1){
M a=A^(x/2+1);
return ans*a+ans+a;
}
return ans*(A^(x/2))+ans;
}
int main(){
B.a[0][1]=B.a[1][0]=B.a[1][1]=1;n=2;
while (~scanf("%d%d%d%d",&k,&b,&nn,&P)){
f.a[0][0]=0;f.a[0][1]=1;
f=f*(B^b);A=B^k;
s=f+f*solve(nn-1);
printf("%d\n",s.a[0][0]);
}
}
#include<bits/stdc++.h>usingnamespacestd;
char s[81];
int n,k,i,a[81],b[81];
struct M{
int a[81][81];
friend M operator*(M x,M y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
for (int k=0;k<n;k++) z.a[i][j]+=x.a[i][k]*y.a[k][j];
return z;
}
friend M operator^(M x,int y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++) z.a[i][i]=1;
for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}A,B;
int main(){
while (1){
scanf("%d%d",&n,&k);
if (!n && !k) return0;
for (i=0;i<n;i++) scanf("%d",&a[i]),a[i]--;
getchar();
gets(s);
for (i=0;i<n;i++) b[a[i]]=i;
memset(A.a,0,sizeof(A.a));
for (i=0;i<n;i++) A.a[b[i]][i]=1;
for (i=0;i<n;i++) B.a[0][i]=i;
B=B*(A^k);
for (i=0;i<n;i++) putchar(s[B.a[0][i]]);
putchar('\n');
}
}
//https://blog.csdn.net/clove_unique/article/details/51482736#include<bits/stdc++.h>usingnamespacestd;
constint P=1000;
int n,m,T,x,y,k;
struct M{
int a[21][21];
friend M operator*(M x,M y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
for (int k=0;k<n;k++) z.a[i][j]=(z.a[i][j]+x.a[i][k]*y.a[k][j])%P;
return z;
}
friend M operator^(M x,int y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<n;i++) z.a[i][i]=1;
for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}A,B;
int main(){
while (1){
scanf("%d%d",&n,&m);
if (!n && !m) return0;
memset(A.a,0,sizeof(A.a));
while (m--) scanf("%d%d",&x,&y),A.a[x][y]=1;
scanf("%d",&T);
while (T--){
scanf("%d%d%d",&x,&y,&k);
B=A^k;
printf("%d\n",B.a[x][y]);
}
}
}
//仿照floyd #include<cstdio>#include<cstring>#include<map>usingnamespacestd;
map<int,int>mp;
int k,T,s,t,l,x,y,n;
struct M{
int a[202][202];
friend M operator*(M x,M y){
M z;
memset(z.a,63,sizeof(z.a));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
for (int k=0;k<n;k++) z.a[i][j]=min(z.a[i][j],x.a[i][k]+y.a[k][j]);
return z;
}
friend M operator^(M x,int y){
M z=x;y--;//运算符重载过了,z不能初始化为单位矩阵 for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}A;
int main(){
scanf("%d%d%d%d",&k,&T,&s,&t);
memset(A.a,63,sizeof(A.a));
while (T--){
scanf("%d%d%d",&l,&x,&y);
if (!mp[x]) mp[x]=++n;
if (!mp[y]) mp[y]=++n;
A.a[mp[x]-1][mp[y]-1]=A.a[mp[y]-1][mp[x]-1]=l;
}
A=A^k;
printf("%d",A.a[mp[s]-1][mp[t]-1]);
}
//https://www.cnblogs.com/KirisameMarisa/p/4187670.html#include<bits/stdc++.h>usingnamespacestd;
constint P=10007;
int n,x,y;
struct M{
int a[4][4];
friend M operator*(M x,M y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<4;i++)
for (int j=0;j<4;j++)
for (int k=0;k<4;k++) z.a[i][j]=(z.a[i][j]+x.a[i][k]*y.a[k][j])%P;
return z;
}
friend M operator^(M x,int y){
M z;
memset(z.a,0,sizeof(z.a));
for (int i=0;i<4;i++) z.a[i][i]=1;
for (;y;y>>=1,x=x*x)
if (y&1) z=z*x;
return z;
}
}f,A;
int main(){
while (~scanf("%d%d%d",&n,&x,&y)){
x%=P;y%=P;
memset(A.a,0,sizeof(A.a));
memset(f.a,0,sizeof(f.a));
A.a[0][0]=A.a[1][2]=1;
A.a[1][3]=x;A.a[3][3]=y;
A.a[1][0]=A.a[1][1]=x*x%P;
A.a[2][0]=A.a[2][1]=y*y%P;
A.a[3][0]=A.a[3][1]=2*x*y%P;
f.a[0][0]=2;f.a[0][1]=f.a[0][2]=f.a[0][3]=1;
f=f*(A^(n-1));
printf("%d\n",f.a[0][0]);
}
}
常见的构造方法POJ3233 Matrix power serieshdu1588 Gauss FibonacciHDu4686 Arc of Dreamhdu2371 题目链hdu2157 How many ways??poj3613 Cow RelaysHDU 3306 Another kind of FibonacciHDU5171POJ3233 Ma...