UVA 10689 Yet another Number Sequence（Fibonacci数列）

题目链接：
UVA 10689 Yet another Number Sequence
题意：
裸的菲波那切数列

#include <cstdio>
#include <cstring>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;

struct Matrix{
    int row,col;
    int data[10][10];
};

void Init(Matrix& x,int row,int col)
{
    x.row=row;
    x.col=col;
    memset(x.data,0,sizeof(x.data));
}

Matrix Multiply(Matrix a,Matrix b,int mod)
{
    Matrix ans;
    Init(ans,a.row,b.col);
    for(int i=1;i<=ans.row;i++){
        for(int j=1;j<=ans.col;j++){
            for(int k=1;k<=a.col;k++){
                ans.data[i][j]+=a.data[i][k]*b.data[k][j]%mod;//卧槽，这里必须先%mod，要不然会WA
                ans.data[i][j]%=mod;
            }
        }
    }
    return ans;
}

void Unit(Matrix& x)
{
    for(int i=1;i<=x.row;i++)
            x.data[i][i]=1;
}

Matrix quick_power(Matrix a,int n,int mod)
{
    Matrix ans,tmp=a;
    Init(ans,a.row,a.col);
    Unit(ans);
    while(n){
        if(n&1) ans=Multiply(ans,tmp,mod);
        tmp=Multiply(tmp,tmp,mod);
        n>>=1;
    }
    return ans;
}

int main()
{
    freopen("Gin.txt","r",stdin);
    int a,b,n,T,m,mod;
    scanf("%d",&T);
    while(T--){
        scanf("%d %d %d %d",&a,&b,&n,&m);
        mod=1;
        while(m--){
            mod*=10;
        }
        a=a%mod,b=b%mod;
        if(n==0){
            printf("%d\n",a);
            continue;
        }else if(n==1){
            printf("%d\n",b);
            continue;
        }
        Matrix tmp,ans;
        tmp.row=tmp.col=2;
        tmp.data[1][1]=0;
        tmp.data[1][2]=tmp.data[2][1]=tmp.data[2][2]=1;
        ans=quick_power(tmp,n-1,mod);
        printf("%d\n",(a*ans.data[2][1]%mod+b*ans.data[2][2]%mod)%mod);
    }
}