Pagini recente » Cod sursa (job #1396292) | Cod sursa (job #393660) | Cod sursa (job #530928) | Cod sursa (job #1193366) | Cod sursa (job #1126143)
#include<fstream>
#include<cstring>
using namespace std;
#define NMAX 2000005
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char A[NMAX],B[NMAX];
int n,m,nr,q,p[NMAX],v[1005];
void prefix()
{
int i,k;
p[1]=0;
k=0;
for (i=2;i<=n;++i)
{
while (k>0 && A[k+1]!=A[i])
k=p[k];
if (A[k+1]==A[i])
++k;
p[i]=k;
}
}
int main()
{
int i;
f.getline(A+1,NMAX);
f.getline(B+1,NMAX);
n=strlen(A+1);
m=strlen(B+1);
prefix();
for (i=1;i<=m;++i)
{
while (q>0 && A[q+1]!=B[i])
q=p[q];
if (A[q+1]==B[i])
++q;
if (q==n)
if (nr<1000)
v[++nr]=i-n;
}
g<<nr<<'\n';
for (i=1;i<=min(nr,1000);++i)
g<<v[i]<<' ';
g<<'\n';
return 0;
}