Pagini recente » Cod sursa (job #1276274) | Cod sursa (job #2257653) | Monitorul de evaluare | Cod sursa (job #2249909) | Cod sursa (job #2365826)
#include <bits/stdc++.h>
#define NMAX 2000001
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[NMAX],B[NMAX];
int pi[NMAX];
int v[1024];
int main()
{
int a,b,i,k,q;
fin>>A>>B;
a=strlen(A);
for(i=a;i>=1;i--)
A[i]=A[i-1];
A[a+1]=0;
b=strlen(B);
for(i=b;i>=1;i--)
B[i]=B[i-1];
B[b+1]=0;
pi[1]=0;
A[0]=' ';
B[0]=' ';
k=0;
for(i=2;i<=a;++i)
{
while(k>0&&A[k+1]!=A[i]) k=pi[k];
if(A[k+1]==A[i]) k++;
pi[i]=k;
}
q=0;
k=0;
for(i=1;i<=b;++i)
{
while(q>0&&A[q+1]!=B[i]) q=pi[q];
if(A[q+1]==B[i]) q++;
if(q==a) {q=pi[a],k++;
if(k<=1000)v[k]=i-a;}
}
fout<<k<<"\n";
for(i=1;i<=min(k,1000);++i)
fout<<v[i]<<" ";
return 0;
}