Pagini recente » Cod sursa (job #743003) | Cod sursa (job #2948416) | Monitorul de evaluare | Cod sursa (job #1931141) | Cod sursa (job #1835388)
#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
#define TSIZE 10000001
#define WSIZE 21
#define NMAX 33343
using namespace std;
ifstream in("abc2.in");
ofstream out("abc2.out");
const int A = 3;
long long int pw[WSIZE];
char text[TSIZE];
vector <long long int> H[NMAX];
long long int rollh(const char* str)
{
unsigned int length = strlen(str);
long long int hcode = 0;
for (unsigned int i = 0; i < length; i++)
hcode += ((str[i] - 'a') * pw[i]);
return hcode;
}
int _find(long long int key)
{
int ind = key % NMAX;
for (unsigned int i = 0; i < H[ind].size(); i++)
if (H[ind][i] == key)
return 1;
return 0;
}
int main()
{
int code, length, length_t, ok = 0;
long long int app = 0;
char word[WSIZE];
///
pw[0] = 1;
for (int i = 1; i < WSIZE; i++)
pw[i] = pw[i - 1] * A;
///
in.getline(text, TSIZE);
while (in.getline(word, WSIZE))
{
code = rollh(word);
if (!ok)
length = strlen(word), ok = 1;
if (!_find(code))
H[code % NMAX].push_back(code);
}
in.close();
///
for (int i = 0; i < length; i++)
word[i] = text[i];
word[length] = '\0';
///
code = rollh(word);
length_t = strlen(text);
for (int i = length; i < length_t; i++)
{
if (_find(code))
app++;
code = (code - (text[i - length] - 'a')) / A + (text[i] - 'a') * pw[length - 1];
}
if (_find(code))
app++;
out << app << "\n";
out.close();
return 0;
}