矩阵快速幂HDU2065

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;//矩阵快速幂的应用
const int maxn = 4;
const int MOD = 100;
struct Matrix
{
    int m[maxn][maxn];
};//矩阵
const Matrix E =
{
    1,0,0,0,
    0,1,0,0,
    0,0,1,0,
    0,0,0,1
};//单位矩阵
const Matrix P
{
    2,1,1,0,
    1,2,0,1,
    1,0,2,1,
    0,1,1,2
};//基矩阵
//矩阵相乘函数
Matrix mult(const Matrix& a,const Matrix& b)
{
    Matrix c;
    memset(c.m,0,sizeof(c.m));
    for(int i=0;i!=maxn;++i)//对于每一行
    {
        for(int k=0;k!=maxn;++k)//对于每一行每一个数
        {
            for(int j=0;j!=maxn;++j)//对于每一列
            {
                c.m[i][j] += a.m[i][k]*b.m[k][j];
                c.m[i][j] %= 100; 
            }
        }
    }
    return c;
}
//矩阵的快速幂
Matrix quickPow(long long num)
{
    Matrix res = E,a = P;
    while(num)
    {
        if(num&1)
        {
            res = mult(res,a);
        }//如果为奇数的话
        a = mult(a,a);
        num >>= 1;//num 除等于 2
    }
    return res;
}
int main()
{
    int t,index = 0;
    while(cin>>t&&t)
    {
        int kase = 0;
        long long n;//计算矩阵的n次幂
        for(int i=0;i!=t;++i)
        {
            cin>>n;
            cout<<"Case "<<++kase<<": "<<quickPow(n).m[0][0]<<endl;
        }
        cout<<endl;
    }
}