Pagini recente » Cod sursa (job #600982) | Cod sursa (job #428752) | Cod sursa (job #2858903) | Cod sursa (job #1538134) | Cod sursa (job #2441977)
#include <bits/stdc++.h>
using namespace std;
/*
#define cin fi
#define cout fo
ifstream fi("abc2.in");
ofstream fo("abc2.out");*/
const int baza = 3;
const int MOD = 999983;
int n, m;
char A[10000005];
char a[25];
list <int> M[1000000];
int getMod(long long x, int M)
{
return x - x / M * M;
}
void baga(long long x)
{
long long grup = getMod(x, MOD);
bool gasit = 0;
for (auto da: M[grup])
if (da == x)
gasit = 1;
if (!gasit)
M[grup].push_front(x);
}
bool este(long long x)
{
long long grup = getMod(x, MOD);
for (auto da: M[grup])
if (da == x)
return 1;
return 0;
}
int main()
{
FILE *fi, *fo;
fi = fopen("abc2.in", "r");
fo = fopen("abc2.out", "w");
fgets(A + 1, 10000000, fi);
n = strlen(A + 1);
while (fgets(A + 1, 30, fi))
{
m = strlen(a + 1);
long long cod = 0;
for (int i = 1; i <= strlen(a + 1); i++)
{
cod = cod * baza + (a[i] - 'a');
}
baga(cod);
}
if (n < m)
{
fprintf(fo, "0");
return 0;
}
int rez = 0;
long long p = 1;
for (int i = 1; i < m; i++)
p *= baza;
long long cod = 0;
for (int i = 1; i <= m; i++)
{
cod = cod * baza + (A[i] - 'a');
}
if (este(cod))
rez++;
for (int i = m + 1; i <= n; i++)
{
cod -= p * (A[i - m] - 'a');
cod = cod * baza + (A[i] - 'a');
if (este(cod))
rez++;
}
fprintf(fo, "%d", rez);
return 0;
}