Pagini recente » Cod sursa (job #2463816) | Cod sursa (job #2118901) | Cod sursa (job #2963316) | Cod sursa (job #67225) | Cod sursa (job #2192416)
#include <fstream>
#include<bits/stdc++.h>
using namespace std;
const unsigned int baza=3;
const unsigned int prim=25000;
vector<unsigned int> hashTable[prim];
char text[10000001],cuvant[21];
unsigned int n,i,j,l,cod,potriviri,idx,p[21],dim;
int main()
{
ifstream f("abc2.in");
ofstream g("abc2.out");
p[0]=1;
for(i=1;i<=20;++i) p[i]=baza*p[i-1];
f>>text;
l=strlen(text);
while(f>>cuvant)
{
cod=0;
n=strlen(cuvant);
for(i=0; i<n; ++i)
cod=cod+(cuvant[i]-'a')*p[i];
hashTable[cod%prim].push_back(cod);
}
cod=0,potriviri=0;
for(i=0; i<n; ++i)
cod=cod+(text[i]-'a')*p[i];
for(; i<l; ++i)
{
idx=cod%prim;dim=hashTable[idx].size();
for(unsigned int j=0; j<dim; ++j)
{
if(hashTable[idx][j]==cod)
{
potriviri++;
break;
}
}
cod/=baza;
cod=cod+(text[i]-'a')*p[n-1];
}
idx=cod%prim;dim=hashTable[idx].size();
for(unsigned int j=0; j<dim; ++j)
{
if(hashTable[idx][j]==cod)
{
potriviri++;
break;
}
}
g<<potriviri<<endl;
return 0;
}