Pagini recente » Cod sursa (job #1178327) | Cod sursa (job #624519) | Cod sursa (job #3263440) | Cod sursa (job #2843992) | Cod sursa (job #519854)
Cod sursa(job #519854)
#include <cstdio>
#include <cstring>
#include <algorithm>
#define DL 10000005
#define DN 20
#define DB 50005
#define ui unsigned int
using namespace std;
char s[DL],cuv[DN];
int n,m,nrc;
ui v[DB];
int main() {
freopen("abc2.in", "r", stdin);
freopen("abc2.out", "w", stdout);
fgets(s, DL, stdin);
n=strlen(s)-1;
while (fgets(cuv, DN, stdin)) {
m=strlen(cuv)-1;
ui cod=0;
for(int i=0; i<m; ++i)
cod=cod*3+cuv[i]-'a';
v[++nrc] = cod;
}
sort(v+1, v+nrc+1);
ui cod=0,pow = 1,sol=0;
for (int i=1;i<m; ++i) pow *= 3;
for (int i=0; i<m; ++i)
cod = cod*3 + s[i]-'a';
int gasit=lower_bound(v+1,v+nrc+1,cod)-v;
if(v[gasit]==cod) ++sol;
for(int i=m; i<n; ++i) {
cod-=pow*(s[i-m]-'a');
cod=cod*3+s[i]-'a';
int gasit=lower_bound(v+1,v+nrc+1,cod)-v;
if(v[gasit]==cod) ++sol;
}
printf("%d\n", sol);
}