Pagini recente » Cod sursa (job #1680679) | Istoria paginii runda/rmi2016/clasament | Istoria paginii runda/aaavram/clasament | Cod sursa (job #2747818) | Cod sursa (job #1252331)
#include <fstream>
#include <cstring>
#define N 2000010
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
void prefix(),kmp();
int p[N],n,sol[1010],A,B,i,q,m;
char a[N],b[N];
int main()
{
fin>>a+1>>b+1;
A=strlen(a+1);
B=strlen(b+1);
prefix();
kmp();
fout<<m <<'\n';
for(i=1;i<=n;i++)
fout<<sol[i]<<' ';
return 0;
}
void prefix()
{
q=0;
for(i=2;i<=A;i++)
{
while(q>0&&a[i]!=a[q+1])
q=p[q];
if(a[i]==a[q+1])
q++;
p[i]=q;
}
}
void kmp()
{
q=0;
for(i=1;i<=B;i++)
{
while(q>0&&b[i]!=a[q+1])
q=p[q];
if(b[i]==a[q+1])
q++;
if(q==A)
{
m++;
if(n<1000)
{
n++;
sol[n]=i-A;
}
}
}
}