1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cstdlib>
 5 #include<algorithm>
 6 #include<cmath>
 7 #include<queue>
 8 #include<set>
 9 #include<map>
10 #include<vector>
11 #include<cctype>
12 using namespace std;
13 const int maxn=1000005;
14 const int maxm=10005;
15
16 int N,f[maxn];
17 char P[maxm],T[maxn];
18
19 void getfail(char *p)
20 {
21     f[0]=f[1]=0;
22     int m=strlen(p);
23     for(int i=1;i<m;i++){
24         int j=f[i];
25         while(j&&p[i]!=p[j]) j=f[j];
26         f[i+1]=p[i]==p[j]?j+1:0;
27     }
28 }
29 int find(char *t,char *p)
30 {
31     getfail(p);
32     int j=0,re=0,m=strlen(p),n=strlen(t);
33     for(int i=0;i<n;i++){
34         while(j&&t[i]!=p[j]) j=f[j];
35         if(t[i]==p[j]) j++;
36         if(j==m) re++,j=f[j];
37     }
38     return re;
39 }
40 int main()
41 {
42     scanf("%d\n",&N);
43     for(int i=1;i<=N;i++){
44         gets(P);gets(T);
45         printf("%d\n",find(T,P));
46     }
47     return 0;
48 }

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cstdlib>
 5 #include<algorithm>
 6 #include<cmath>
 7 #include<queue>
 8 #include<set>
 9 #include<map>
10 #include<vector>
11 #include<cctype>
12 using namespace std;
13 const int maxn=1000005;
14 const int maxm=105;
15 const int mo=20071027;
16
17 int N,f[maxn];
18 char T[maxn],S[maxm];
19 struct Trie{
20     static const int maxnd=4000005;
21     static const int sigma_size=26;
22     int np,ch[maxnd][sigma_size],val[maxnd];
23     Trie(){ np=0,val[0]=0; memset(ch[0],0,sizeof(ch[0])); }
24     void insert(char *s)
25     {
26         int now=0,i=strlen(s)-1;
27         while(i>=0){
28             if(!ch[now][s[i]-'a']){
29                 ch[now][s[i]-'a']=++np;
30                 memset(ch[np],0,sizeof(ch[np]));
31                 val[np]=0;
32             }
33             now=ch[now][s[i--]-'a'];
34         }
35         val[now]++;
36     }
37     int find(int i)
38     {
39         int now=0,re=0;
40         while(i>0){
41             if(!ch[now][T[i]-'a']) break;
42             now=ch[now][T[i--]-'a'];
43             if(val[now]) re=(re+f[i])%mo;
44         }
45         if(!i&&val[ch[now][T[i]-'a']]) re=(re+1)%mo;
46         return re;
47     }
48 }trie;
49
50 void data_in()
51 {
52     gets(T); scanf("%d\n",&N);
53     for(int i=1;i<=N;i++){
54         gets(S);
55         trie.insert(S);
56     }
57 }
58 void work()
59 {
60     int n=strlen(T);
61     for(int i=0;i<n;i++) f[i]=trie.find(i);
62     printf("%d\n",f[n-1]);
63 }
64 int main()
65 {
66     data_in();
67     work();
68     return 0;
69 }