Pagini recente » Rezultatele filtrării | Cod sursa (job #1190516) | Rezultatele filtrării | Cod sursa (job #2488711) | Cod sursa (job #2768579)
#include<stdio.h>
#include<string.h>
#define N 2000001
char s[N],u[N];
int v[1000],i,t,k,m,n,p[N];
int main()
{
freopen("strmatch.in","r",stdin),freopen("strmatch.out","w",stdout),scanf("%s%s",s,u),m=strlen(s),n=strlen(u);
for(i=2;i<m;i++) {
while(k&&s[k+1]!=s[i])
k=p[k];
if(s[k+1]==s[i])
k++;
p[i]=k;
}
for(k=0,i=1;i<n;i++) {
while(k&&s[k+1]!=u[i])
k=p[k];
if(s[k+1]==u[i])
k++;
if(k==m-1&&s[0]==u[i-k]) {
if(t<1000)
v[t]=i-m+1;
t++;
}
}
for(printf("%d\n",t),t=t>1000?1000:t,i=0;i<t;i++)
printf("%d ",v[i]);
return 0;
}