hdu 1575 Tr A

矩阵的快速幂。。。

#include <iostream>
#include <cstdio>
#include <vector>

typedef long long ll;
typedef std::vector<ll> vec;
typedef std::vector<vec> mat;
const int MODE = 9973;

mat mul(mat& A, mat& B)
{
	mat C(A.size(), vec(B[0].size()));
	ll A_str = A.size();
	ll B_str = B.size();
	ll B0_str = B[0].size();
	for (ll i = 0; i < A_str; ++i)
		for (int k = 0; k < B_str; ++k)
			for (int j = 0; j < B0_str; ++j)
				C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MODE;
	return C;
}

mat pow(mat A, ll n)
{
	mat B(A.size(), vec(A.size()));
	ll A_str = A.size();
	for (ll i = 0; i < A_str; ++i)
	{
		B[i][i] = 1;
	}
	while (n)
	{
		if (n & 1)
			B = mul(B, A);
		A = mul(A, A);
		n >>= 1;
	}

	return B;
}

int main()
{
	int t;
	std::cin >> t;
	while (t--)
	{
		ll n, k;
		std::cin >> n >> k;
		mat A(n, vec(n));
		ll tmp;
		for (ll i = 0; i != n; ++i)
		{
			for (ll j = 0; j != n; ++j)
			{
				std::cin >> tmp;
				A[i][j] = tmp;
			}
		}
		A = pow(A, k);
		ll sum = 0;
		for (int i = 0; i != n; ++i)
		{
			sum = (sum + A[i][i]) % MODE;
		}
		std::cout << sum << std::endl;
	}

	return 0;
}