Pagini recente » Cod sursa (job #266496) | Cod sursa (job #3234247) | Cod sursa (job #526591) | Cod sursa (job #1631638) | Cod sursa (job #1798385)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,m,i,q,k,urm[2000005],a[2000005],v;
char N[2000005],M[2000005];
int main()
{
f.getline(N,2000005);
f.getline(M,2000005);
k=0;
n=strlen(N);
urm[1]=0;
for(i=2;i<=n;i++)
{
if(k>0&&N[k]!=N[i-1]) k=urm[k];
if(N[k]==N[i-1]) k++;
urm[i]=k;
}
q=0;
m=strlen(M);
for(i=0;i<m;i++)
{
if(q>0&&N[q]!=M[i]) q=urm[q];
if(N[q]==M[i]) q++;
if(q==n) {v++; a[v]=i-n+1;}
}
g<<v<<'\n';
if(v<=1000)
{for(i=1;i<=v;i++) g<<a[i]<<" ";}
else
{
for(i=1;i<=1000;i++) g<<a[i]<<" ";
}
return 0;
}