bzoj1009（kmp，dp，矩阵乘法，快速幂）

Description
　　阿申准备报名参加GT考试，准考证号为N位数X1X2….Xn(0<=Xi<=9),他不希望准考证号上出现不吉利的数字。
他的不吉利数学A1A2…Am(0<=Ai<=9)有M位，不出现是指X1X2…Xn中没有恰好一段等于A1A2…Am. A1和X1可以为
0

Input
　　第一行输入N,M,K.接下来一行输入M位的数。 N<=10^9,M<=20,K<=1000

Output
　　阿申想知道不出现不吉利数字的号码有多少种，输出模K取余的结果.

Sample Input
4 3 100
111
Sample Output
81

---

看上去很像容斥…
考虑dp
$f_{i,j}$表示前$i$位，匹配了$j$位的方案数
考虑下一位，有可能继续匹配，有可能部分失陪，有可能全部失配
根据$next$数组构造转移矩阵 快速幂优化即可

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define Pil pair<int,ll>
#define Pli pair<ll,int>
#define Pll pair<ll,ll>
#define pb push_back 
#define pc putchar
#define file(k) memset(k,0,sizeof(k))
#define ll long long
int n , len , pp;
char s[30];
int Next[30];
struct martix{
    int f[30][30];
}G,A;
int read()
{
    int sum = 0;char c = getchar();bool flag = true;
    while( c < '0' || c > '9' ) {if(c == '-') flag = false;c = getchar();}
    while( c >= '0' && c <= '9' ) sum = sum * 10 + c - 48 , c = getchar();
    if(!flag)  sum = -sum;
    return sum;
} 
void init()
{
    n = read();len = read();pp = read();
    scanf("%s",s+1);
    int j = 0;
    rep(i,2,len)
    {
        while(j && s[j+1] != s[i]) j = Next[j];
        if(s[j+1] == s[i]) j++;
        Next[i] = j;
    }
    return;
}
bool vis[30];
void make_martix()
{
    rep(i,0,len-1)
    {
        file(vis);
        int sum = 0;
        if(!vis[s[i+1] - '0']) 
        {
            G.f[i][i+1]++;
            vis[s[i+1] - '0'] = true;
            sum++;
        }
        int j = i;
        while(j)
        {
            j = Next[j];
            if(!vis[s[j+1] - '0'])
            {
                G.f[i][j+1]++;
                vis[s[j+1] - '0'] = true;
                sum++;
            }
        }
        G.f[i][0] = 10 - sum;
    }
    G.f[len][len] = 10;
    A.f[0][0] = 1;
    return;
}
void re(martix &now)
{
    rep(i,0,len)
        rep(j,0,len)
            now.f[i][j] = i==j?1:0;
    return;
}
martix mul(martix a,martix b,int n,int m,int p)//n*p 和 p*m
{
    martix ans;
    rep(i,0,n)
        rep(j,0,m)
        {
            ans.f[i][j] = 0;
            rep(k,0,p)
                ans.f[i][j] = (ans.f[i][j] + a.f[i][k] * b.f[k][j] % pp)%pp;   
        }
    return ans;
}
martix Pow(martix a,int k)
{
    martix now;
    re(now);
    while(k)
    {
        if(k & 1)
            now = mul(now , a , len , len , len);
        a = mul(a , a , len , len , len);
        k >>= 1;
    }
    return now;
}
int main()
{
    init();
    make_martix();
    G = Pow(G,n);
    A = mul(A,G,0,len,len);
    int ans = 0;
    rep(i,0,len-1) ans = (ans + A.f[0][i])%pp;
    printf("%d\n",ans); 
    return 0;
}