Pagini recente » Clasament rating | Monitorul de evaluare | Profil Nanite | Diferente pentru home intre reviziile 236 si 237 | Cod sursa (job #1203645)
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int Z[4000005],i,N,M,nr;
char S[4000005];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(S+1); N=strlen(S+1); S[N+1]='.';
gets(S+N+2); M=strlen(S+N+2);
int L=N+1,R=N+1;
for (i=N+2;i<=N+M+1;i++)
{
if (R>=i) Z[i]=min(Z[i-L+1],R-i+1);
for (;i+Z[i]<=N+M+1 && S[i+Z[i]]==S[Z[i]+1];Z[i]++);
if (i+Z[i]-1>R) L=i,R=i+Z[i]-1;
if (Z[i]>=N) nr++;
}
printf("%d\n",nr);
for (i=N+2;i<=N+M+1;i++) if (Z[i]>=N) printf("%d ",i-N-2);
return 0;
}