矩阵快速幂3 k*n铺方格

 #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 = ;

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

         return C;
     }
 };

 //
 //第i行不放置：new_x = x << 1, new_y = (y << 1) + 1; 列数+1
 //第i行竖放骨牌：new_x = (x << 1) + 1, new_y = y << 1; 列数+1
 //第i行横向骨牌：new x = (x << 2) + 3, new_y = (y << 2) + 3; 列数+2

 int k;
 Martix A(,),F(,);
 void dfs(int x,int y,int col)
 {
     if(col == k) {A.martix[y][x] = ; return ;}
     dfs(x<<, (y<<) + , col+);
     dfs( (x<<) + , y << , col + );
     if(col +  <= k)
         dfs( (x << )+ , (y << )+, col+);
 }

 void solve()
 {
     int n;
     scanf("%d %d",&k,&n);
     if( (k&) && (n&) )
     {
         printf("%d\n",);
         return ;
     }
     A.sets(<<k,<<k);
     F.sets(<<k,<<k);
     dfs(,,);
     for(int i = ; i < (<<k); i++)
         F.martix[i][i] = ;
     while(n > )
     {
         if(n & )
             F = F*A;
         A = A*A;
         n >>= ;
     }
     printf("%lld\n",F.martix[ (<<k)- ][ (<<k)- ]);
 }

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