Pagini recente » Cod sursa (job #2353651) | Cod sursa (job #2224810) | Cod sursa (job #385674) | Cod sursa (job #2680733) | Cod sursa (job #2911321)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[2000005],b[2000005];
int p[2000005],s[1001],l,nr;
int A;
int B;
int main()
{
fin>>a+1;
fin>>b+1;
A=strlen(a+1);
B=strlen(b+1);
for(int i=2; i<=A; 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<=B; i++)
{
while(l!=0 && b[i]!=a[l+1])
{
l=p[l];
}
if(b[i]==a[l+1])
l++;
if(l==A)
{
nr++;
if(nr<1000)
s[nr]=i-A;
l=p[l];
}
}
fout<<nr<<"\n";
for(int i=1;i<=min(1000,nr);i++)
{
fout<<s[i]<<" ";
}
}