Pagini recente » Cod sursa (job #2959752) | Cod sursa (job #2760982) | Cod sursa (job #304682) | Cod sursa (job #3192820) | Cod sursa (job #2806935)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("abc2.in");
ofstream fout("abc2.out");
const int base = 3, mod = 30007;
int ans;
string s, cuv;
vector <unsigned int> dictionar[mod + 2];
int len, s_len;
unsigned int base_pow, myHash;
bool check(unsigned int Hash)
{
unsigned int modh = Hash % mod;
for(int i = 0; i < (int) dictionar[modh].size(); i++)
if(Hash == dictionar[modh][i])
return true;
return false;
}
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
fin >> s;
s_len = s.size();
while(fin >> cuv)
{
len = (int) cuv.size();
myHash = 0;
for(int i = 0; i < len; i++)
myHash = myHash * base + (cuv[i] - 'a');
if(!check(myHash))
dictionar[(unsigned int) myHash % mod].push_back(myHash);
}
base_pow = 1;
for(int i = 1; i < len; i++)
base_pow *= base;
myHash = 0;
for(int i = 0; i < len; i++)
myHash = myHash * base + (s[i] - 'a');
if(check(myHash))
ans++;
for(int i = len; i < s_len; i++)
{
myHash = myHash - base_pow * (s[i - len] - 'a');
myHash = myHash * base + (s[i] - 'a');
if(check(myHash))
ans++;
}
fout << ans;
return 0;
}