Pagini recente » Cod sursa (job #1262652) | Cod sursa (job #1314851) | Cod sursa (job #3122438) | Cod sursa (job #2887388) | Cod sursa (job #792729)
Cod sursa(job #792729)
#include <cstdio>
#include <cstring>
using namespace std;
char a[2000010],b[2000010];
int pi[2000010],h[2000010],p;
void posibilitate()
{
int k=0;
pi[0]=0;
for(int i=1;i<strlen(a);i++)
{
while(k>0 && a[k]!=a[i])
k=pi[k];
if(a[k]==a[i])
k+=1;
pi[k+1]=k;
}
}
void rezolvare()
{
int q=0;
for(int i=0;i<strlen(b);i++)
{
while(q>0 && a[q]!=b[i])
q=pi[q-1];
if(a[q]==b[i])
q++;
if(q==strlen(a))
h[p++]=i-strlen(a)+1;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a);
gets(b);
posibilitate();
rezolvare();
printf("%d\n",p);
for(int i=0;i<p;i++)
printf("%d ",h[i]);
printf("\n");
return 0;
}