Pagini recente » Cod sursa (job #1155750) | Cod sursa (job #3175406) | Cod sursa (job #2979622) | Cod sursa (job #1263505) | Cod sursa (job #793522)
Cod sursa(job #793522)
#include <cstdio>
#include <cstring>
#define N 2000010
using namespace std;
char a[N],b[N];
int urmator[N],h[N],z;
void formare(char p[N])
{
int i,j,m=strlen(p);
urmator[0]=-1;
for(i=0,j=-1;i<m;i++,j++,urmator[i]=j)
while(j>=0 && p[i]!=p[j])
j=urmator[j];
}
void rezolvare(char *p,char *q)
{
int i,j,m=strlen(p),n=strlen(q);
for(i=0,j=0;i<n;i++,j++)
{
while(j>=0 && p[j]!=q[i])
j=urmator[j];
if(j==m-1)
h[z++]=i-m+1;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(a);
gets(b);
formare(a);
rezolvare(a,b);
printf("%d\n",z);
for(int i=0;i<z;i++)
printf("%d ",h[i]);
return 0;
}