Pagini recente » Cod sursa (job #3252802) | Cod sursa (job #1268453) | Cod sursa (job #2560757) | Cod sursa (job #386649) | Cod sursa (job #1314388)
#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
#define MOD 666013
#define lung 10000010
using namespace std;
char s[lung],sir[25];
vector<unsigned int>H[MOD];
int n,m,i;
unsigned int sol,key,t,h;
int main()
{
ifstream f("abc2.in");
ofstream g("abc2.out");
f.getline(s+1,lung);
n=strlen(s+1);
while(f.getline(sir+1,25))
{
m=strlen(sir+1);
t=0;
for (i=1;i<=m;++i)
t=(t*3+(sir[i]-'a'));
key=t%MOD;
bool e=true;
for (i=0;i<H[key].size();++i)
if (H[key][i]==t) {e=false;break;}
if (e==true)
H[key].push_back(t);
}
t=0;h=1;
for (i=1;i<=m;++i)
{
t=(t*3+(s[i]-'a'));
h=h*3;
}
h=h/3;
key=t%MOD;
for (i=0;i<H[key].size();++i)
if (H[key][i]==t) {++sol;break;}
for (i=m+1;i<=n;++i)
{
t=((t-(s[i-m]-'a')*h)*3+(s[i]-'a'));
key=t%MOD;
vector<unsigned int >::iterator it;
for (it=H[key].begin();it!=H[key].end();++it)
if (*it==t) {++sol;break;}
}
g<<sol<<"\n";
return 0;
}