Pagini recente » Cod sursa (job #2232517) | Cod sursa (job #2226611) | Cod sursa (job #2398827) | Cod sursa (job #777683) | Cod sursa (job #687448)
Cod sursa(job #687448)
#include<iostream>
#include<fstream>
#include<bitset>
#include<string.h>
using namespace std;
char a[21],b[10000001];
int v[21],n,m;
bitset <2000001> poz;
void prefix()
{
int i,q;
v[1]=0;
q=0;
for(i=2;i<=n;i++) {
while((q)&&(a[q+1]!=a[i]))
q=v[q];
if(a[q+1]==a[i])
q++;
v[i]=q;
}
}
int main ()
{
int i,p,q;
ifstream f("abc2.in");
ofstream g("abc2.out");
f>>b;
m=strlen(b);
for(i=m;i>=1;i--)
b[i]=b[i-1];
b[0]=' ';
p=0;
while(f.peek()!=EOF) {
f>>a;
n=strlen(a);
for(i=n;i>=1;i--)
a[i]=a[i-1];
a[0]=' ';
prefix();
q=0;
for(i=1;i<=m;i++) {
while((q)&&(b[i]!=a[q+1]))
q=v[q];
if(b[i]==a[q+1])
q++;
if(q==n)
poz[i-n]=1;
}
}
f.close();
p=0;
for(i=0;i<=1000000;i++)
p=p+poz[i];
g<<p;
g.close();
return 0;
}