矩阵快速幂

http://acm.hdu.edu.cn/showproblem.php?pid=1575

#include 
#include 
#include 
using namespace std;
const int N=11,mod=9973;
int n,b;
struct Matrix
{
    int m[N][N];
}curr;
Matrix multi(Matrix a,Matrix b)
{
    Matrix ans;
    memset(ans.m,0,sizeof(ans.m));
    for(int i=0;i>=1;
    }
    return ans;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&b);
        for(int i=0;i