斐波那契 矩阵快速幂

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <map>
#include <time.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define LL long long

using namespace std;
using namespace __gnu_pbds;

const int MOD = 19999997;

struct Martix
{
    LL martix[2][2];
    int row,col;
    Martix(int _row,int _col)
    {
        memset(martix,0,sizeof(martix));
        row = _row;
        col = _col;
    }
    Martix operator *(const Martix &A)const
    {
        Martix C(row, A.col);
        for(int i = 0; i < row; i++)
            for(int j = 0; j < A.col; j++)
                for(int k = 0; k < col; k++)
                    C.martix[i][j] =  (C.martix[i][j] + martix[i][k] * A.martix[k][j])%MOD;
        return C;
    }
};


void solve()
{
    Martix A(2,2), F(2,2);
    A.martix[0][0] = A.martix[0][1] = A.martix[1][0] = 1;
    F.martix[0][0] = F.martix[1][1] = 1;
    int n;
    scanf("%d",&n);
    while(n > 0)
    {
        if(n & 1)
            F = F*A;
        A = A*A;
        n >>= 1;
    }
    printf("%lld
",F.martix[0][0]);
}

int main(void)
{
    solve();
    return 0;
}