Pagini recente » Cod sursa (job #897978) | Cod sursa (job #2349232) | Cod sursa (job #2906931) | Cod sursa (job #383356) | Cod sursa (job #2911178)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000001], b[2000001];
int n, m, s[1001], l, p[2000001], nr;
int main()
{
fin>>a+1;
fin>>b+1;
n=strlen(a+1);
m=strlen(b+1);
l=0;
for(int i=2; i<=n; i++)
{
while(l!=0 && a[i]!=a[l+1])
{
l=p[l];
}
if(a[i]==a[l+1])
{
l++;
}
p[i]=l;
}
l=0;
for(int i=1; i<=m; i++)
{
while(l!=0 && b[i]!=a[l+1])
{
l=p[l];
}
if(b[i]==a[l+1])
{
l++;
}
if(l==n)
{
nr++;
if(nr<=1000)
{
s[nr]=i-n;
}
l=p[l];
}
}
fout<<nr<<"\n";
for(int i=1; i<=min(nr, 1000); i++)
{
fout<<s[i]<<" ";
}
return 0;
}