Pagini recente » Cod sursa (job #3237894) | Cod sursa (job #2196577) | Cod sursa (job #1445476) | Cod sursa (job #2475172) | Cod sursa (job #2440067)
#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 MOD1 = 1000003;
const int MOD2 = 1e9 + 9;
int n, m;
char A[10000005];
char a[25];
bool M[MOD1];
inline void adauga(long long x)
{
int nr = x % MOD1;
M[nr] = 1;
}
inline bool este(long long x)
{
int nr = x % MOD1;
return M[nr];
}
int main()
{
cin >> A + 1;
n = strlen(A + 1);
while (cin >> a + 1)
{
m = strlen(a + 1);
long long cod = 0;
for (int i = 1; i <= strlen(a + 1); i++)
{
cod = cod * baza + (a[i] - 'a');
}
adauga(cod);
}
if (n < m)
{
cout << 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++;
}
cout << rez;
return 0;
}