Pagini recente » Cod sursa (job #2415131) | Cod sursa (job #658413) | Cod sursa (job #32155) | Cod sursa (job #2272558) | Cod sursa (job #1830953)
#include <cstdio>
#include <cstring>
using namespace std;
char sub[2000001],str[2000001];
int pattern[2000001],n,m,rez[2000001];
int counter=0;
void makePattern()
{
for(int i=1,j=0;i<n;i++)
{
while(sub[i]!=sub[j] && j>0)
j=pattern[j-1];
if(sub[i]==sub[j])
pattern[i]=++j;
}
}
void searchPattern()
{
for(int i=0,j=0;i<m;i++)
{
while(str[i]!=sub[j] && j>0)
j=pattern[j-1];
if(str[i]==sub[j])
{
if(j==n-1)
{
rez[counter++]=i-n+1;
j=pattern[j];
}
else
j++;
}
if(counter==1000)
return;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n%s",&sub,&str);
n=strlen(sub);
m=strlen(str);
makePattern();
searchPattern();
printf("%d\n",counter);
for(int i=0;i<counter;i++)
printf("%d ",rez[i]);
return 0;
}