HDU 5690 All X 矩阵快速幂

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5690
题意:问一个全部由X组成的M位数 对K取余之后是否等于c
构造一个公式 之后用矩阵快速幂 解即可!

#include <bits/stdc++.h>
#define sf scanf
#define pf printf

using namespace std;
typedef long long LL;
const int maxn = 3;
LL x,m,mod,c;
struct Mix{
    int n,m;
    LL C[maxn][maxn];
};
Mix operator*(Mix a,Mix b){
    Mix tmp;
    tmp.n = a.n,tmp.m = b.m;
    for(int i = 1;i <= tmp.n;++i){
        for(int j = 1;j <= tmp.m;++j){
            tmp.C[i][j] = 0;
            for(int k = 1;k <= a.m;++k){
                tmp.C[i][j] = (tmp.C[i][j] + a.C[i][k] * b.C[k][j]) % mod;
            }
        }
    }
    return tmp;
}

Mix POW(Mix a,LL m){
    Mix tmp;
    tmp.n = tmp.m = a.n;
    memset(tmp.C,0,sizeof tmp.C);
    for(int i = 1;i <= tmp.m;++i) tmp.C[i][i] = 1;
    while(m){
        if(m & 1){
            tmp = tmp * a;
        }
        a = a * a;
        m = m >> 1;
    }
    return tmp;
}
Mix F1,A;

char ans[][10] = {"No","Yes"};
int main(){
    int T,ca = 0;
    sf("%d",&T);
    while( T-- ){
        sf("%lld %lld %lld %lld",&x,&m,&mod,&c);
        F1.n = 2,F1.m = 1;
        F1.C[1][1] = x;
        F1.C[2][1] = 1;
        A.n = A.m = 2;
        A.C[1][1] = 10,A.C[1][2] = x,A.C[2][1] = 0,A.C[2][2] = 1;
        F1 = POW(A,m - 1) * F1;
        pf("Case #%d:\n%s\n",++ca,ans[F1.C[1][1] == c]);
    }
}