递推加字典树,令d(i)为从字符i开始的字符串,d(i)=sum{d(i+len(x)}
#include<bits/stdc++.h>
using namespace std;
const int maxn=300000+10;
const int maxs=100+10;
const int maxnode=4000*105;
const int signa_size=26;
const int mod=20071027;
int ch[maxnode][signa_size],vis[maxnode],d[maxn];
int sz,n,kase;
char s[maxn];
void init(){
sz=1;
memset(ch[0],0,sizeof(ch[0]));
}
int idx(char c){
return c-'a';
}
void insert(char *s){
int u=0,n=strlen(s);
for(int i=0;i<n;i++){
int c=idx(s[i]);
if(!ch[u][c]){
memset(ch[sz],0,sizeof(ch[sz]));
vis[sz]=0;
ch[u][c]=sz++;
}
u=ch[u][c];
}
vis[u]=1;
}
int main(){
kase=1;
while(scanf("%s",s)!=EOF){
init();
int num;
scanf("%d",&num);
for(int i=1;i<=num;i++){
char a[maxs];
scanf("%s",a);
insert(a);
}
memset(d,0,sizeof(d));
n=strlen(s);
d[n]=1;
for(int i=n-1;i>=0;i--){
int j=i,u=0;
while(j<n){
int c=idx(s[j]);
if(ch[u][c]==0) break;
u=ch[u][c];
if(vis[u])
d[i]=(d[i]+d[j+1])%mod;
j++;
}
}
printf("Case %d: %d\n",kase++,d[0]);
}
}