Pagini recente » Cod sursa (job #388436) | Cod sursa (job #2192709) | Cod sursa (job #258524) | Cod sursa (job #18980) | Cod sursa (job #101643)
Cod sursa(job #101643)
#include <stdio.h>
#include <string.h>
#define S ((1<<20)-1)
int V[S+10], Nr, P[100002];
char ss[100002], ss2[50002];
int main()
{
int i, j, hash, l, n, t, ok;
freopen("abc2.in", "r", stdin);
gets(ss);
n = strlen(ss);
while (scanf(" %s", ss2)==1)
{
l = strlen(ss2);
for (i = 0; i < n; i++)
{
ok = 1;
for (j = 0; ok && j < l; j++)
if (ss[i+j]!=ss2[j]) ok = 0;
if (ok&&!P[i]) { Nr++;
P[i] = 1; }
}
}
freopen("abc2.out", "w", stdout);
printf("%d\n", Nr);
return 0;
}