第一个点TLE，求解

#include<iostream>
#include<string.h>
using namespace std;
const int maxn=100,base=1e9+7;
struct matrix
{
    long long v[maxn][maxn];
    int n;
    matrix(){    memset(v,0,sizeof(v));}
    matrix operator * (const matrix &b)const
    {
        matrix c;
        c.n=this->n;
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                for(int k=0;k<n;k++)
                    c.v[i][j]=(
c.v[i][j]+this->v[i][k]*b.v[k][j])%base;
        return c;
    }
    friend istream & operator >> (istream &in,matrix &a)
    {
        for(int i=0;i<a.n;i++)
            for(int j=0;j<a.n;j++)
                cin>>a.v[i][j];
        return in;
    }
    friend ostream & operator << (ostream &out,const matrix &a)
    {
        for(int i=0;i<a.n;i++)
        {
            for(int j=0;j<a.n;j++)
                out<<a.v[i][j]<<' ';
            out<<endl;
        }
        return out;
    }
};
matrix a;
int main()
{
    ios::sync_with_stdio(false);
    a.n=2;a.v[0][0]=1,a.v[0][1]=1,a.v[1][0]=1,a.v[1][1]=0;
    long long k;
    cin>>k;
    k-=1;
    matrix t=a,ans=a;
    for(k--;k;k>>=1,t=t*t)
        if(k&1)    ans=ans*t;
    cout<<ans.v[0][0]<<endl;
    return 0;
}