UVA 3942 Remember the Word

#include<cstdio>
#include<cstring>
const int M=400010,mod=20071027;
char a[M],s[110];
int l,d[M],son[M][30];
bool h[M];
void init(){
	l=strlen(a);
	memset(h,0,sizeof(h));
	memset(son,0,sizeof(son));
    int i,j,p,n,tot=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%s",s);
		p=0;
        for(j=0;j<strlen(s);j++){
            if(son[p][s[j]-'a']==0)
				son[p][s[j]-'a']=++tot;
            p=son[p][s[j]-'a'];
        }
        h[p]=1;
    }
}
void solve(){
    int i,j,p;
    d[l]=1;
    for(i=l-1;i>=0;i--){
        p=0;d[i]=0;
        for(j=i;j<l;j++){
            p=son[p][a[j]-'a'];
            if(p==0)break;
            if(h[p])d[i]=(d[i]+d[j+1])%20071027;
        }
    }
}
int main(){
    int kase=0;
    while(scanf("%s",a)!=EOF){
        init();
        solve();
        printf("Case %d: %d\n",++kase,d[0]);
    }
    return 0;
}