Pagini recente » Cod sursa (job #1946634) | Rotatie lexicografic minima | Cod sursa (job #1752549) | Cod sursa (job #868092) | Cod sursa (job #2300732)
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin ("abc2.in");
ofstream fout ("abc2.out");
const int mod = 10041, N = 10000010, M = 50010;
unsigned int n, len_cuv, len_text, x, i, cnt, nr, pow;
char text[N], cuv[M];
vector<unsigned int> L[mod + 10];
void hashing() {
x = 0;
for (i = 0 ; i < len_cuv; ++i) {
x = x * 3 + (cuv[i] - 'a');
}
nr = x % mod;
for (int i = 0; i < L[nr].size(); ++i) {
if (L[nr][i] == x){
return;
}
}
L[nr].push_back(x);
}
void verifica(int x) {
nr = x % 10041;
for (int i = 0; i < L[nr].size(); ++i) {
if (L[nr][i] == x){
cnt++;
return;
}
}
}
int main() {
fin >> text;
len_text = strlen(text);
fin >> cuv;
len_cuv = strlen(cuv);
hashing();
while(fin >> cuv) {
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');
}
fout << cnt;
return 0;
}