矩阵斐波那契数列

#include<cstdio>
#include<cstdlib>
#include<cstring>

using namespace std;

const int mo=1000000007;

int n;

struct matrix
{
	int n,m;
	int z[5][5];
	matrix(){n=m=0;memset(z,0,sizeof(z));}
};


matrix operator*(const matrix &m1,const matrix &m2)
{
	matrix m3;
	m3.n = m1.n;
	m3.m = m2.m;
	for (int i=1;i<=m3.n;i++)
		for (int j=1;j<=m3.m;j++)
			for (int k=1;k<=m1.m;k++)
				m3.z[i][j] = (m3.z[i][j] + 1ll*m1.z[i][k]*m2.z[k][j])%mo;
	return m3;
}


matrix mul(matrix x,int y)//x^y
{
	if (y==0)
	{
		matrix z;
		z.n=z.m=x.n;
		for (int a=1;a<=z.n;a++)
			z.z[a][a]=1;
		return z;
	}
	matrix v=mul(x,y>>1);
	v=v*v;
	if (y&1) v=v*x;
	return v;
}

int main()//logn
{
	scanf("%d",&n);
	matrix A,B;
	A.n=1;A.m=2;
	A.z[1][1]=1;A.z[1][2]=1;
	B.n=2;B.m=2;
	B.z[1][1]=1;B.z[1][2]=1;
	B.z[2][1]=1;B.z[2][2]=0;
	A = A*mul(B,n-2);
	printf("%d\n",A.z[1][1]);

	return 0;
}