题目:http://acm.hdu.edu.cn/showproblem.php?pid=1575
题目描述:A为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。
解题方法:矩阵快速幂
code:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 7;
const int N = 12;
const int mod = 9973;
int num[N][N];
int res[N][N];
int temp[N][N];
void multi(int a[][N], int b[][N])
{
memset(temp, 0, sizeof(temp));
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
for(int k = 0; k < N; k++)
temp[i][j] = (temp[i][j] + a[i][k] * b[k][j]) % mod;
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
a[i][j] = temp[i][j];
}
void MatPow(int a[][N], int n)
{
memset(res, 0, sizeof(res));
for(int i = 0; i < N; i++) res[i][i] = 1;
while(n)
{
if(n & 1)
{
multi(res, a);
}
multi(a, a);
n >>= 1;
}
}
int main()
{
int T, n, k;
scanf("%d", &T);
while(T--)
{
memset(num, 0, sizeof(num));
scanf("%d %d", &n, &k);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
scanf("%d", &num[i][j]);
MatPow(num, k);
int ans = 0;
for(int i = 0; i < n; i++)
ans = (ans + res[i][i]) % mod;
printf("%d\n", ans % mod);
}
return 0;
}