Pagini recente » Cod sursa (job #98890) | Cod sursa (job #2697666) | Cod sursa (job #2933169) | Cod sursa (job #103950) | Cod sursa (job #974343)
Cod sursa(job #974343)
#include <fstream>
#include <cstring>
using namespace std;
char a[200005], b[200005];
int t[200005], sol[1005],min1;
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s%s",a,b);
int res=0;
t[0]=-1;
int k=0,n=strlen(a),m=strlen(b);
for(int j=1;j<n;j++)
{
while(k&&a[j]!=a[k])
k=t[k-1];
if(a[j]==a[k])
k++;
t[j]=k;
}
k=0;
for(int i=0;i<m;i++)
{
while(k&&b[i]!=a[k])
k=t[k-1];
if(b[i]==a[k])
k++;
if(k==n)
{
if(res<1000)
sol[res]=i-n+1;
res++;
k=t[k-1];
}
}
min1=min(res,1000);
printf("%d\n", res);
for(int i=0; i<min1; i++)
printf("%d ", sol[i]);
return 0;
}