Pagini recente » Cod sursa (job #595403) | Cod sursa (job #2564275) | Cod sursa (job #2916415) | Cod sursa (job #2902812) | Cod sursa (job #2245086)
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <fstream>
#define minim(a,b) ((a<b)?a:b)
#define NMax 2000005
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int N,M;
char A[NMax],B[NMax];
int pi[NMax],pos[1024];
void make_prefix(void)
{
int i,q=0;
for(i=2,pi[1]=0;i<=M;i++)
{
while(q && A[q+1]!=A[i])
q=pi[1];
if(A[q+1]==A[i])
++q;
pi[i]=q;
}
}
int main()
{
int i,q=0,n=0;
f>>A;
f>>B;
M=strlen(A);
N=strlen(B);
for(i=M;i;--i) A[i]=A[i-1];
A[0]=' ';
for(i=N;i;--i) B[i]=B[i-1];
B[0]=' ';
make_prefix();
for(i=1;i<=N;i++)
{
while(q && A[q+1]!=B[i])
q=pi[q];
if(A[q+1]==B[i])
++q;
if(q==M)
{
q=pi[M];
++n;
if(n<=1000)
pos[n]=i-M;
}
}
g<<n<<'\n';
for(i=1;i<=minim(n,1000);i++)
g<<pos[i]<<' ';
return 0;
}