Pagini recente » Cod sursa (job #2191772) | Cod sursa (job #1745585) | Cod sursa (job #1354532) | Cod sursa (job #869024) | Cod sursa (job #2056324)
#include <fstream>
#include<string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int pi[2000001],N,M,pos[2000001],n;
char A[2000001],B[2000001];
void prefix()
{
int i,q=0;
for(i=2,pi[1]=0;i<=M;++i)
{
while(q&&A[q+1]!=A[i]) q=pi[q];
if(A[q+1]==A[i]) q++;
pi[i]=q;
}
}
int main()
{
int i;
f.getline(A,1001);
f.getline(B,1001);
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]=' ';
prefix();
int q=0;
for(i=2;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;
pos[n]=i-M;
}
}
g<<n<<'\n';
for(i=1;i<=n;i++) g<<pos[i]<<' ';
g<<'\n';
f.close();
g.close();
return 0;
}