HDU 2243

//因为2^64次方不可能表示，直接定义unsigned __int64，可以自动截断。其他和POJ 2778差不多。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <climits>
#include <string.h>
#include <queue>
#include <cmath>
#include <vector>
#define LL unsigned __int64
using namespace std;
const int dictsize=26;
const int root=0;
const int QN=100;
struct Node{
    int fail,next[dictsize];
    bool tag;
    void initial(){
        memset(next,-1,sizeof(next));
        tag=false,fail=-1;
    }
};
Node trie[50];
int que[QN],head,tail,tot;
struct Matrix{
    LL mat[95][95];
}a,per,number;
int n,l;
char str[20];

void Insert_trie(){
    int p=root,i=0,index;
    while(str[i]){
        index=str[i]-'a';
        if(trie[p].next[index]==-1){
            trie[p].next[index]=++tot;
        }
        p=trie[p].next[index];
        i++;
    }
    trie[p].tag=true;
}

void build_ac(){
    int p,tmp;
    que[tail++]=root;
    while(head!=tail){
        tmp=que[head++];
        p=-1;
        for(int i=0;i<dictsize;i++){
            if(trie[tmp].next[i]!=-1){
                if(tmp==root) trie[trie[tmp].next[i]].fail=root;
                else{
                    p=trie[tmp].fail;
                    while(p!=-1){
                        if(trie[p].next[i]!=-1){
                            trie[trie[tmp].next[i]].fail=trie[p].next[i];
                            break;
                        }
                        p=trie[p].fail;
                    }
                    if(p==-1) trie[trie[tmp].next[i]].fail=root;
                }
                if(trie[trie[trie[tmp].next[i]].fail].tag)
                trie[trie[tmp].next[i]].tag=true;
                que[tail++]=trie[tmp].next[i];
            }
            else{    //    tmp[tmp].next[i]==-1
                if(tmp==root) trie[tmp].next[i]=root;
                else{
                    p=trie[tmp].fail;
                    while(p!=-1){
                        if(trie[p].next[i]!=-1){
                            trie[tmp].next[i]=trie[p].next[i];
                            break;
                        }
                        p=trie[p].fail;
                    }
                    if(p==-1){
                        trie[tmp].next[i]=root;
                    }
                }
            }
        }
    }
}

void build_map(){
    memset(a.mat,0,sizeof(a.mat));
    for(int i=0;i<=tot;i++){
        for(int j=0;j<dictsize;j++)
        if(!trie[i].tag&&!trie[trie[i].next[j]].tag)
        a.mat[i][trie[i].next[j]]++;
    }
    int tmp=2*tot+1;
    for(int i=0;i<=tmp;i++){
        for(int j=tot+1;j<=tmp;j++){
            if(i==j) a.mat[i][j]=1;
            else if(j-tot-1==i) a.mat[i][j]=1;
        }
    }
    number.mat[0][0]=26,number.mat[0][1]=1;
    number.mat[1][0]=0,number.mat[1][1]=1;
}

Matrix Multi(Matrix a,Matrix b,int e){
    Matrix c;
    for(int i=0;i<=e;i++){
        for(int j=0;j<=e;j++){
            c.mat[i][j]=0;
            for(int k=0;k<=e;k++)
            c.mat[i][j]=(c.mat[i][j]+(a.mat[i][k]*b.mat[k][j]));
        }
    }
    return c;
}

Matrix multi(Matrix s,LL k,int e){
//    cout<<k<<endl;
    Matrix ret=per,p=s;
    while(k){
        if(k&1) ret=Multi(ret,p,e);
        k>>=1;
        p=Multi(p,p,e);
    }
    return ret;
}

int main(){
    memset(per.mat,0,sizeof(per.mat));
    for(int i=0;i<95;i++)
    per.mat[i][i]=1LL;
    while(scanf("%d%d",&n,&l)!=EOF){
        for(int i=0;i<35;i++)
        trie[i].initial();
        tot=head=tail=0;
        for(int i=1;i<=n;i++){
            scanf("%s",str);
            Insert_trie();
        }
        build_ac();
        build_map();
    //    cout<<tot<<endl;
        Matrix n1=multi(number,(LL)l+1LL,1);
        Matrix n2=multi(a,(LL)l+1LL,2*tot+1);
        LL ans=n1.mat[0][1];
//        cout<<ans<<endl;
/*        for(int i=0;i<=2*tot+1;i++){
        for(int j=0;j<=2*tot+1;j++)
        cout<<a.mat[i][j]<<" ";
        cout<<endl;
        }*/
        int tmp=2*tot+1;
        for(int i=tot+1;i<=tmp;i++)
        ans=(ans-n2.mat[0][i]);
        printf("%I64u
",ans);
    }
}