Pagini recente » Cod sursa (job #2546952) | Bordura | Cod sursa (job #2183574) | Cod sursa (job #121336) | Cod sursa (job #2300876)
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int mod = 10041, N = 10001010, M = 30;
unsigned int n, len_cuv, len_text, x, i, cnt, nr, pow;
char text[N], cuv[M];
vector<unsigned int> L[mod + 10];
inline void hashing() {
x = 0;
for (i = 0 ; i < len_cuv; ++i) {
x = x * 3 + (cuv[i] - 'a');
}
nr = x % mod;
for (auto it:L[nr]) {
if (it == x){
return;
}
}
L[nr].push_back(x);
}
inline void verifica(unsigned int x) {
nr = x % mod;
for (auto it:L[nr]) {
if (it == x){
cnt++;
return;
}
}
}
int main() {
freopen("abc2.in", "r", stdin);
freopen("abc2.out", "w", stdout);
scanf("%s\n", text);
len_text = strlen(text);
scanf("%s\n", cuv);
len_cuv = strlen(cuv);
hashing();
while(scanf("%s\n", cuv) != EOF) {
hashing();
}
x = 0;
pow = 1;
for(i = 1; i < len_cuv; ++i) {
pow = pow * 3;
}
for(i = 0; i < len_cuv - 1; ++i) {
x = x * 3 + (text[i] - 'a');
}
for(i = len_cuv - 1; i < len_text; ++i) {
x = x * 3 + (text[i] - 'a');
verifica(x);
x = x - pow * (text[i - len_cuv + 1] - 'a');
}
printf("%u", cnt);
return 0;
}