Pagini recente » Cod sursa (job #197794) | Cod sursa (job #239960) | Cod sursa (job #2175234) | Cod sursa (job #1297786) | Cod sursa (job #1482417)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
long n,m,i,pi[2000003],nr,sav[1005];
char A[2000003],B[2000003];
void prefix()
{
long k=0;
pi[1]=0;
for (i=2;i<=n;i++)
{
while (k>0 && A[k+1]!=A[i])
k=pi[k];
if (A[k+1]==A[i])
k++;
pi[i]=k;
}
}
int main()
{
f>>A+1>>B+1;
n=strlen(A+1);
m=strlen(B+1);
prefix();
long k=0;
for (i=1;i<=m;i++)
{
while (k>0 && A[k+1]!=B[i])
k=pi[k];
if (A[k+1]==B[i])
k++;
if (k==n)
{
nr++;
if (nr<=1000)
sav[nr]=i-n;
}
}
g<<nr<<'\n';
long mn;
mn=nr;
if (mn>1000)
mn=1000;
for (i=1;i<=mn;i++)
g<<sav[i]<<' ';
return 0;
}