hdu 1021 矩阵快速幂

最新推荐文章于 2022-07-29 11:41:21 发布

wwwlps

最新推荐文章于 2022-07-29 11:41:21 发布

阅读量162

点赞数

分类专栏： acm

本文链接：https://blog.csdn.net/wwwlps/article/details/78219949

版权

acm 专栏收录该内容

96 篇文章 1 订阅

订阅专栏

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
#define LL long long
#define MOD 3
using namespace std;
typedef struct
{
	LL z[2][2];
}matrix;
matrix addmatrix(matrix a,matrix b)
{
	matrix x;
	memset(x.z,0,sizeof(x.z));
	for(int i=0;i<2;i++)
	{
		for(int j=0;j<2;j++)
		{
			x.z[i][j]+=a.z[i][j]+b.z[i][j];
			//x.z[i][j]%=MOD;
		}
	}
	return x;
}
matrix mulmatrix(matrix a,matrix b)
{
	matrix x;
	memset(x.z,0,sizeof(x.z));
	for(int i=0;i<2;i++)
	{
		for(int j=0;j<2;j++)
		{
			for(int k=0;k<2;k++)
			{
				x.z[i][j]+=a.z[i][k]*b.z[k][j];
				x.z[i][j]%=MOD;
			}
		}
	}
	return x;
}
matrix powmatrix(matrix a,LL n)
{
	matrix x;
	memset(x.z,0,sizeof(x.z));
	for(int i=0;i<2;i++)
	{
		x.z[i][i]=1;
	}
	while(n!=0)
	{
		if(n&1)
		{
			x=mulmatrix(x,a);
		}
		a=mulmatrix(a,a);
		n/=2;
	}
	return x;
}
int main()
{
	int n;
	while(cin>>n)
	{
		matrix a,b,res;
		a.z[0][0]=1;a.z[0][1]=1;a.z[1][0]=1;a.z[1][1]=0;
		b.z[0][0]=11;b.z[0][1]=0;b.z[1][0]=7;b.z[1][1]=0;
		if(n!=0)
		{
			res=powmatrix(a,n-1);
			res=mulmatrix(res,b);
			//cout << res.z[0][0] << endl;
			if(res.z[0][0]%3==0)
				cout << "yes\n";
			else
				cout << "no\n";
		}
		else
			cout << "no\n";
	}
}