hdu6470 Count 矩阵快速幂

hdu6470 Count

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 const int maxn = , mod = ;

 struct MAT {
     ll a[maxn][maxn];
     MAT(){ memset(a,,sizeof(a)); }
     MAT operator*(MAT p) {
         MAT res;
         for (int i = ; i < maxn; i++)
             for (int j = ; j < maxn; j++)
                 for(int k = ; k < maxn; k++)
                     res.a[i][j] = (res.a[i][j]+a[i][k]*p.a[k][j])%mod;
         return res;
     }
 };
 MAT mat_qpow(MAT A, ll b) {
     MAT res;
     res.a[][] = ;
     for (int i = ; i < maxn; i++) {
         res.a[i][i] = ;
     }
     while(b) {
         if(b&) res = res*A;
         A = A*A;
         b >>= ;
     }
     return res;
 }
 void init(MAT& A, MAT& B) {
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;
     A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=, A.a[][]=;

     B.a[][]=, B.a[][]=, B.a[][]=, B.a[][]=, B.a[][]=, B.a[][]=;
 }

 int main() {
     int t; scanf("%d",&t);
     while(t--) {
         ll n; scanf("%lld",&n);
         MAT A; MAT ans;
         init(A,ans);
         ans = mat_qpow(A,n-)*ans;
         printf("%lld\n",ans.a[][]);
     }
     return ;
 }