Pagini recente » Cod sursa (job #1425196) | Cod sursa (job #1050594) | Cod sursa (job #869347) | Cod sursa (job #2243441) | Cod sursa (job #3240152)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int i,nr,n,m,urm[2000009],a[2000009];
char A[2000009],B[2000009];
void urmatorul(char *P)
{
int k=-1,x;
urm[0]=0;
for(x=1; x<n; x++)
{
while(k>0 && A[k+1]!=A[x])
{
k=urm[k];
}
if(A[k+1]==A[x])
{
k++;
}
urm[x]=k;
}
}
int main()
{
int x=-1;
fin.getline(A,2000009);
fin.getline(B,2000009);
n=strlen(A);
m=strlen(B);
urmatorul(A);
nr=0;
for(i=0; i<m; i++)
{
while(x>0 && A[x+1]!=B[i])
{
x=urm[x];
}
if(A[x+1]==B[i])
{
x++;
}
if(x==n-1)
{
nr++;
a[nr]=i-n+1;
x=urm[x];
}
}
fout<< nr << "\n";
for(i=1; i<=nr; i++)
{
fout<< a[i] << " ";
}
return 0;
}