Pagini recente » Cod sursa (job #2345816) | Cod sursa (job #2802138) | Cod sursa (job #788535) | Cod sursa (job #1119882) | Cod sursa (job #1505156)
#include <cstdio>
#include <cstring>
#include <vector>
#define MOD 90907
using namespace std;
int lungime,lim;
unsigned int put[20];
vector<unsigned int>b[MOD];
char ch1[10000004],ch2[25];
int ct=0;
int findit(unsigned int a)
{
int key=a%MOD;
vector<unsigned int>::iterator it;
for(it=b[key].begin();it!=b[key].end();++it)
{
if(*it==a)
{
return 1;
}
}
return 0;
}
int main()
{
freopen ("abc2.in","r",stdin);
freopen ("abc2.out","w",stdout);
gets(ch1);
gets(ch2);
lungime=strlen(ch2);
lim=strlen(ch1);
put[0]=1;
for(int i=1;i<20;i++) put[i]=put[i-1]*3;
unsigned int h1=0;
while(1)
{
h1=0;
for(int i=0;i<lungime;i++) h1+=(ch2[i]-'a')*put[lungime-1-i];
if(findit(h1)==0) b[h1%MOD].push_back(h1);
ch2[0]='!';
gets(ch2);
if(ch2[0]=='!') break;
}
h1=0;
for(int i=0;i<lungime;i++) h1+=(ch1[i]-'a')*put[lungime-1-i];
ct+=findit(h1);
for(int i=lungime;i<lim;i++)
{
h1-=((ch1[i-lungime]-'a')*put[lungime-1]);
h1*=3;
h1+=(ch1[i]-'a');
ct+=findit(h1);
}
printf("%d\n",ct);
}