Pagini recente » Cod sursa (job #2404715) | Cod sursa (job #2837662) | Cod sursa (job #198458) | Cod sursa (job #3159052) | Cod sursa (job #2569999)
#include <bits/stdc++.h>
#define Nmax 2000005
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
char a[Nmax], b[Nmax];
int pi[Nmax], n, m, k, sol[Nmax], nr;
int main()
{
fin.getline(a+1, Nmax);
fin.getline(b+1, Nmax);
a[0]='1';
b[0]='1';
n=strlen(a)-1;
m=strlen(b)-1;
for(int i=2;i<=n;i++)
{
while(k>0 && a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
k++;
pi[i]=k;
}
k=0;
for(int i=1;i<=m;i++)
{
while(k>0 && a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])
k++;
if(k==n)
sol[++nr]=i-n;
}
fout << nr << '\n';
for(int i=1;i<=min(nr, 1000);i++)
fout << sol[i] << ' ';
return 0;
}