矩阵快速幂求斐波拉切数列

#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

#define ll long long

#define N 2

struct matrix

{

ll m

;

};

ll ans

,temp

;

matrix mul(ll a

,ll b

)

{

int i,j,k;

matrix ret={0};

for(i=0;i<N;i++)

{

for(j=0;j<N;j++)

{

for(k=0;k<N;k++)

{

ret.m[i][j]+=a[i][k]*b[k][j];

}

}

}

return ret;

}

int main()

{

int t,n;

scanf("%d",&t);

while(t--)

{

scanf("%d",&n);

matrix ans,temp;

ans.m[0][0]=1;ans.m[0][1]=0;

ans.m[1][0]=0;ans.m[1][1]=0;

temp.m[0][0]=1;temp.m[0][1]=1;

temp.m[1][0]=1;temp.m[1][1]=0;

while(n)

{

if(n&1)ans=mul(ans.m,temp.m);

temp=mul(temp.m,temp.m);

n>>=1;

}

printf("%I64d\n",ans.m[0][0]+ans.m[1][0]);

}

return 0;

}