[板子]矩阵加速

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;

const int mod=1000000007
int n;
void mul(int f[2],int a[2][2]){
    int c[2];
    memset(c,0,sizeof(c));
    for(int j=0;j<2;++j){
        for(int k=0;k<2;++k){
            c[j]=(c[j]+(ll)f[k]*a[k][j])%mod;
        }
    }
    memcpy(f,c,sizeof(c));
}
void mulself(int a[2][2]){
    int c[2][2];
    memset(c,0,sizeof(c));
    for(iont i=0;i<2;++i){
        for(int j=0;j<2;++j){
            for(int k=0;k<2;++k){
                c[i][j]=(c[i][j]+(ll)a[i][k]*a[k][j])%mod;
            }
        }
    }
    memcpy(a,c,sizeof(c));
}
void qc(int f[2],int a[2][2],int n){
    int k[2];
    memcpy(k,f,sizeof(f));
    while(n){
        if(n&1){
            mul(k,a);
        }
        mulself(a);
        n>>=1;
    }
    memcpy(f,k,sizeof(k));
}