Pagini recente » Cod sursa (job #1933821) | Cod sursa (job #389412) | Cod sursa (job #1570496) | Cod sursa (job #1722340) | Cod sursa (job #3249626)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000010],b[2000010];
int pi[2000010];
int n,m,i,j;
int v[2000010];
void get_pi(char sir[])
{
int n=strlen(sir);
int k=0;
for(int i=1;i<n;i++)
{
while(k!=0 && sir[i]!=sir[k])
k=pi[k-1];
if(sir[i]==sir[k])
k++;
pi[i]=k;
}
}
int main()
{
fin>>a>>b;
n=strlen(a);
m=strlen(b);
get_pi(a);
int k=0;
for(int i=0;i<m;i++)
{
while(k!=0 && b[i]!=a[k])
k=pi[k-1];
if(b[i]==a[k])
k++;
if(k==n)
v[++v[0]]=i-k+1;
}
fout<<v[0]<<'\n';
for(int i=1;i<=min(1000,v[0]);i++)
fout<<v[i]<<" ";
return 0;
}