POJ3070(简单的矩阵快速幂)

模板题，没啥东西；
code：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<string>
#include <set>
#include<time.h>
//a&3==a%4
using namespace std ;
#define ll int
#define mem(a) memset(a,0,sizeof(a))
const double eps = 1e-8;
const int maxn = 110010;
const int inf = 0x3f3f3f3f;
ll mod=10000;

struct matrix
{
    ll mat[30][30];
    matrix()
    {
        memset(mat,0,sizeof(mat));
    }
};

matrix multiply(matrix a,matrix b,int n)
{
    matrix res;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            for(int k=0;k<n;k++)
            {
                res.mat[i][j]+=a.mat[i][k]*b.mat[k][j]%mod;
                res.mat[i][j]%=mod;
            }
        }
    }
    return res;
}

matrix quickmi(matrix a,ll b,int n)
{
    matrix E;
    E.mat[0][0]=1;
    matrix res;
    if(b==0)
    {
        return E;
    }

    for(int i=0;i<n;i++)
    {
        E.mat[i][i]=1;
        res.mat[i][i]=1;
    }
    E=multiply(a,E,n);
    while(b>0)
    {
        if(b%2==1)
        {
            res=multiply(res,E,n);
        }
        b=b/2;
        E=multiply(E,E,n);
    }
    return res;
}

int main()
{
    matrix res;
    res.mat[0][0]=1;
    res.mat[0][1]=1;
    res.mat[1][0]=1;
    matrix sum;
    ll n;
    while(cin>>n&&n!=-1)
    {
        sum=quickmi(res,n,2);
        cout<<sum.mat[0][1]<<endl;
    }
    return 0;
}