Pagini recente » Cod sursa (job #2738421) | Cod sursa (job #644424) | Cod sursa (job #2362416) | Cod sursa (job #430520) | Cod sursa (job #101279)
Cod sursa(job #101279)
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
char w[10000000], c, s[20];
int x, i, nr, ind, lg;
unsigned int sol, r, v[50005], pt[21], cnt;
int cmp(const void*a, const void*b){
unsigned int x = *(unsigned int *)a, y = *(unsigned int*)b;
if (x < y) return -1;
if (x > y) return 1;
return 0;
}
int caut(unsigned int cnt){
int li = 0, ls = ind, x;
while (li <= ls){
x = (li+ls) / 2;
if (cnt == v[x])
return 1;
else
if (cnt < v[x])
ls = x-1;
else
li = x+1;
}
return 0;
}
int main()
{
freopen("abc2.in", "rt", stdin);
freopen("abc2.out", "wt", stdout);
fgets(w, 10000000, stdin);
pt[0] = 1;
for (i=1; i<=20; i++)
pt[i] = 3*pt[i-1];
x = scanf("%c", &c);
ind = -1;
while (x != EOF){
nr = 0;
while (c != '\n'){
s[++nr] = c;
x = scanf("%c", &c);
}
r = 0;
for (i=1; i<=nr; i++){
x = s[i]-'a';
r += x*pt[nr-i];
}
v[++ind] = r;
x = scanf("%c", &c);
}
qsort(v, ind+1, sizeof(v[0]), cmp);
lg = strlen(w);
lg --;
cnt = 0;
for (i=0; i<nr; i++){
x = w[i]-'a';
cnt += pt[nr-i-1]*x;
}
if(caut(cnt))
sol ++;
for (i=nr; i<lg; i++){
x = w[i]-'a';
cnt = (cnt - pt[nr-1]*(w[i-nr]-'a')) * 3 + x;
if (caut(cnt))
sol ++;
}
printf("%u\n", sol);
fclose(stdin);
fclose(stdout);
return 0;
}