Pagini recente » Cod sursa (job #2624104) | Cod sursa (job #1037621) | Cod sursa (job #912863) | Cod sursa (job #342184) | Cod sursa (job #299887)
Cod sursa(job #299887)
#include <fstream.h>
#include <string.h>
#define nmax 2000001
char A[nmax],B[nmax];
int p[nmax],sol[1001],nr;
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>A;
f>>B;
int n,m,i;
n=strlen(A);
for(i=n;i>=0;i--)A[i]=A[i-1];
m=strlen(B);
for(i=m;i>=0;i--)B[i]=B[i-1];
p[1]=0;
int k=0;
for(i=2;i<=n;i++)
{
while (k>0 && A[k+1]!=A[i])k=p[k];
if (A[k+1]==A[i])k++;
p[i]=k;
}
k=0;
for (i=1;i<=m;i++)
{
while (k>0 && A[k+1]!=B[i])k=p[k];
if(A[k+1]==B[i])k++;
if(k==n)
{
nr++;
if(nr<=1000)sol[nr]=i-n;
k=p[k];
}
}
g<<nr<<'\n';
if (nr>1000)nr=1000;
for (i=1;i<=nr;i++)
g<<sol[i]<<" ";
}