Pagini recente » Cod sursa (job #1545893) | Cod sursa (job #847157) | Cod sursa (job #2466487) | Cod sursa (job #1539050) | Cod sursa (job #1119099)
#include <cstdio>
#include <cstring>
#define Nmax 2000005
using namespace std;
int N,M,pi[Nmax],sol[Nmax];
char a[Nmax],b[Nmax];
inline void Pi()
{
int i,k=0;
for(i=2;i<=N;++i)
{
while(k && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
pi[i]=pi[k]+1;
else
pi[i]=0;
}
}
int main()
{
int k=0,i;
freopen ("strmatch.in","r",stdin);
freopen ("strmatch.out","w",stdout);
scanf("%s%s", (a+1),(b+1));
N=strlen(a+1); M=strlen(b+1);
Pi();
for(i=1;i<=M;++i)
{
while(k && a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])
++k;
if(k==N && sol[0]<1000)
sol[++sol[0]]=i-N;
}
printf("%d\n", sol[0]);
for(i=1;i<=sol[0];++i)
printf("%d ", sol[i]);
printf("\n");
return 0;
}