链接
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2090
题解
一整天都在抽各种时间调试qwq
终于过了,最后发现爆了int
网上都是那种分治的做法,
t
o
o
b
o
r
i
n
g
too\ boring
too boring~~~~
倍增多好啊qwq
预处理
p
o
w
e
r
n
=
A
2
n
power_n=A^{2^n}
powern=A2n,
S
n
=
∑
i
=
1
2
n
A
i
S_n=\sum_{i=1}^{2^n}A^i
Sn=∑i=12nAi
把
k
k
k进行二进制拆分,设
k
=
2
b
1
+
b
2
+
.
.
.
+
b
m
k=2^{b_1+b_2+...+b_m}
k=2b1+b2+...+bm,其中
b
i
b_i
bi表示了一个等于
1
1
1的二进制位
那么
a
n
s
=
∑
i
=
1
m
S
b
i
∏
j
=
1
i
−
1
p
o
w
b
j
ans=\sum_{i=1}^mS_{b_i}\prod_{j=1}^{i-1}pow_{b_j}
ans=i=1∑mSbij=1∏i−1powbj
这个式子看起来有点吓人其实代码就两行qwq
代码
//矩阵、倍增
#include <bits/stdc++.h>
#define maxn 50
#define mod 10
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
int N, K;
struct matrix
{
int a[maxn][maxn], n, m;
matrix(int n, int m, bool I=false):n(n),m(m)
{
cl(a);
if(I)for(int i=1;i<=n;i++)a[i][i]=1;
}
matrix():n(0),m(0){cl(a);}
int* operator[](int index){return a[index];}
matrix operator*(matrix b)
{
matrix c(n,b.m);
for(int i=1;i<=n;i++)for(int j=1;j<=c.m;j++)for(int k=1;k<=m;k++)c[i][j]+=a[i][k]*b[k][j];
for(int i=1;i<=c.n;i++)for(int j=1;j<=c.m;j++)c[i][j]%=mod;
return c;
}
matrix operator+(matrix b)
{
matrix c(n,m);
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)c[i][j]=(a[i][j]+b[i][j])%mod;
return c;
}
void show()
{
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)printf("%d",a[i][j]), putchar(j==m?10:32);
}
};
void work()
{
int i, j;
matrix power[maxn], s[maxn], ans(N,N), tmp(N,N,true), mat(N,N);
for(i=1;i<=N;i++)for(j=1;j<=N;j++)scanf("%d",mat[i]+j), mat[i][j]%=10;
power[0]=s[0]=mat;
for(i=1;i<=20;i++)
{
power[i]=power[i-1]*power[i-1];
s[i]=s[i-1]*power[i-1]+s[i-1];
}
for(i=0;i<=20;i++)
{
if(K&(1<<i))
{
ans = ans + tmp*s[i];
tmp = tmp * power[i];
}
}
ans.show();
putchar(10);
}
int main()
{
while(scanf("%d%d",&N,&K), N)
work();
return 0;
}