hdoj 1575 Tr A 51nod oj 1113 矩阵快速幂【矩阵快速幂】

传送门：1575

矩阵快速幂--与一般快速幂一样--

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
	int n;
	long long shu[12][12];
	node operator * (node &b){
		node c;
		c.n=n;
		for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
		{
			c.shu[i][j]=0;
			for (int k=1;k<=n;k++)
			c.shu[i][j]=(c.shu[i][j]+shu[i][k]*b.shu[k][j])%9973;
		}
		return c;
	}
}a,b,c,ans;
void slove()
{
	int n,k;long long s=0;
	scanf("%d%d",&a.n,&k);
	for (int i=1;i<=a.n;i++)
	for (int j=1;j<=a.n;j++)
	scanf("%lld",&a.shu[i][j]);
	ans.n=a.n;
	for (int i=1;i<=a.n;i++)
	for (int j=1;j<=a.n;j++)
	ans.shu[i][j]=0;
	for (int i=1;i<=a.n;i++)
	ans.shu[i][i]=1;
	while (k)
	{
		if (k%2)
			ans=ans*a;
		a=a*a;
		k/=2;
	}
	for (int i=1;i<=a.n;i++)
		s=(s+ans.shu[i][i])%9973;
	printf("%lld\n",s);
}
int main()
{
	int t;scanf("%d",&t);
	while (t--)
	slove();
	return 0;
}

传送门：1113

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long mod=1000000007;
struct node{
	int n;
	long long shu[120][120];
	node operator * (node &b){
		node c;
		c.n=n;
		for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
		{
			c.shu[i][j]=0;
			for (int k=1;k<=n;k++)
			c.shu[i][j]=(c.shu[i][j]+shu[i][k]*b.shu[k][j])%mod;
		}
		return c;
	}
}a,b,c,ans;
void slove()
{
	int n,k;long long s;
	scanf("%d%d",&a.n,&k);
	for (int i=1;i<=a.n;i++)
	for (int j=1;j<=a.n;j++)
	scanf("%lld",&a.shu[i][j]);
	ans.n=a.n;
	for (int i=1;i<=a.n;i++)
	for (int j=1;j<=a.n;j++)
	ans.shu[i][j]=0;
	for (int i=1;i<=a.n;i++)
	ans.shu[i][i]=1;
	while (k)
	{
		if (k%2)
			ans=ans*a;
		a=a*a;
		k/=2;
	}
	for (int i=1;i<=a.n;i++)
	{
		for (int j=1;j<a.n;j++)
		printf("%lld ",ans.shu[i][j]);
		printf("%lld\n",ans.shu[i][a.n]);
	}
}
int main()
{
	slove();
	return 0;
}