Pagini recente » Cod sursa (job #2865508) | Cod sursa (job #181919) | Cod sursa (job #2177590) | Cod sursa (job #1459141) | Cod sursa (job #1848165)
#include <stdio.h>
#include <cstring>
using namespace std;
char s1[2000000],s2[2000000];
int n,m,i,j,k;
int pi[2000001],sol[1001];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s",&s1);
scanf("%s",&s2);
n = strlen(s1);
m = strlen(s2);
for(i=1; i<n; i++)
{
while(k>0 && s1[i]!=s1[k])
k=pi[k-1];
if(s1[i]==s1[k])
k++;
pi[i]=k;
}
k=0;
for(i=0; i<m; i++)
{
while(k>0 && s2[i]!=s1[k])
k=pi[k-1];
if(s2[i]==s1[k])
k++;
if(k==n){
k = pi[n-1];
sol[++j] = i-n+1;
}
}
printf("%d\n",j);
j=(j<1000)?j:1000;
for(i=1;i<=j;i++)
printf("%d ",sol[i]);
return 0;
}