Pagini recente » Cod sursa (job #2870813) | Cod sursa (job #1177174) | Cod sursa (job #479960) | Cod sursa (job #1695430) | Cod sursa (job #1818704)
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int urm[100];
char t[2000001],p[2000001],n,m,nr,apar[1001];
void urmator(char p[])
{
int m=strlen(p+1);
urm[1]=0;
int k=0;
for(int q=2;q<=m;q++)
{
while(k>0&&p[k+1]!=p[q])
k=urm[k];
if(p[k+1]==p[q])k++;
urm[q]=k;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
cin>>p+1>>t+1;
n=strlen(t+1);
m=strlen(p+1);
urmator(p);
int q=0;
for(int i=1;i<=n;i++)
{
while(q>0&&p[q+1]!=t[i])
q=urm[q];
if(p[q+1]==t[i])
q++;
if(q==m&&nr<999)
{
apar[nr++]=i-m;
q=urm[q];
}
}
printf("%d\n",nr);
for(int i=0;i<nr;i++)
printf("%d ",apar[i]);
return 0;
}