Pagini recente » Cod sursa (job #2479235) | Cod sursa (job #1177528) | Cod sursa (job #124167) | Cod sursa (job #1265111) | Cod sursa (job #1309610)
# include <fstream>
# include <cstring>
# include <vector>
# include <algorithm>
# define mod 999997
using namespace std;
ifstream f("abc2.in");
ofstream g("abc2.out");
vector <unsigned int> h[mod];
int i,j,l,L,VV,r;
unsigned int var,nr,p;
char s[10000005],ch[25];
void citeste ()
{
f.getline(s+1, 10000005);
L=strlen(s+1);
while (f.getline(ch+1,25))
{
l=strlen(ch+1);
nr=0;
for (i=1; i<=l; ++i)
nr=nr*3+(ch[i]-'a');
//inserez
r=nr%mod;
if (find(h[r].begin(), h[r].end(), nr)==h[r].end())
h[r].push_back(nr);
}
}
int main ()
{
citeste();
var=0; p=1;
for (i=1; i<=l; ++i)
{
var=var*3+(s[i]-'a');
p*=3;
}
p/=3; r=var%mod;
if (find(h[r].begin(), h[r].end(), var)!=h[r].end()) ++VV;
for (i=l+1; i<=L; ++i)
{
var=(var-(s[i-l]-'a')*p)*3+(s[i]-'a');
r=var%mod;
if (find(h[r].begin(), h[r].end(), var)!=h[r].end()) ++VV;
}
g<<VV<<"\n";
return 0;
}