Pagini recente » Cod sursa (job #127442) | Cod sursa (job #1297338) | Cod sursa (job #134228) | Cod sursa (job #1153638) | Cod sursa (job #1821250)
#include<fstream>
#include<string.h>
using namespace std;
#define N 200005
char a[N],b[N];
int p[N],po[1005],n,m;
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>a>>b;
n=strlen(a);
m=strlen(b);
int i,k=0;
p[0]=0;
for(i=1;i<n;++i)
{
while(k>0&&a[i]!=a[k])
k=p[k-1];
if(a[k]==a[i])
++k;
p[i]=k;
}
k=0;
int d=0;
for(i=0;i<m;++i)
{
while(k>0&&a[k]!=b[i])
k=p[k-1];
if(a[k]==b[i])
++k;
if(k==n)
{
++d;
k=p[k-1];
if(d<=1000)
po[d-1]=i+1-n;
}
}
g<<d<<"\n";
if(d>1000)
d=1000;
for(i=0;i<d;++i)
g<<po[i]<<" ";
f.close();
g.close();
}