C++-POJ3070-Fibonacci-[矩阵乘法][快速幂]

 #include <cstdio>
 struct Matrix{int a[][];};
 const int N=,MOD=1e4;
 Matrix A,B,O,I;
 Matrix Mul(Matrix A,Matrix B){
     Matrix C=O;
     for(int i=;i<=N;i++)
         for(int j=;j<=N;j++)
             for(int k=;k<=N;k++)
                 C.a[i][j]=(C.a[i][j]+A.a[i][k]*B.a[k][j])%MOD;
     return C;
 }
 Matrix Pow(Matrix A,int n){
     Matrix B=I;
     for(;n;n>>=,A=Mul(A,A))if(n&)B=Mul(B,A);
     return B;
 }
 int main(){
     for(int i=;i<=;i++)for(int j=;j<=;j++)O.a[i][j]=,I.a[i][j]=(i==j);
     A.a[][]=,A.a[][]=;
     A.a[][]=,A.a[][]=;
     int n;
     while(scanf("%d",&n)){
         if(n==-)break;
         B=Pow(A,n+),printf("%d\n",B.a[][]);
     }
     return ;
 }