Pagini recente » Istoria paginii utilizator/dolhacatalin | Cod sursa (job #1548740) | Monitorul de evaluare | Cod sursa (job #1002085) | Cod sursa (job #1457579)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
long n,m,i,j,pr[2000005],nr,v[2000005];
char A[2000005],B[2000005];
void prefix()
{
long k=-1;
for (int i=1;i<n;i++)
{
while (k>0 && A[k+1]!=A[i])
k=pr[k];
if (A[k+1]==A[i])
k++;
pr[i]=k;
}
}
int main()
{
f>>A>>B;
n=strlen(A);
m=strlen(B);
prefix();
long k=-1;
pr[0]=-1;
for (i=0;i<m;i++)
{
if (A[k+1]!=B[i])
{
while (k>=0 && A[k+1] !=B[i])
k=pr[k];
}
else if (A[k+1]==B[i])
k++;
if (k==n-1)
{
nr++;
v[nr]=i-n+1;
}
}
g<<nr<<'\n';
for (i=1;i<=nr;i++)
g<<v[i]<<' ';
return 0;
}