Pagini recente » Rating Mario Negoita (MarioNegoita) | Cod sursa (job #2911567)
#include <fstream>
#include <cstring>
#include <cctype>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout("strmatch.out");
int i,sol,na,nb,V[2000003],S[1003],j,minim;
char A[2000003],B[2000003];
int main()
{
fin>>A+1;
na=strlen(A+1);
fin>>B+1;
nb=strlen(B+1);
for(i=2;i<=na;i++)
{
while(A[i]!=A[j+1]&&j>0)
j=V[j];
if(A[i]==A[j+1])
j++;
V[i]=j;
}
j=0;
for(i=1;i<=nb;i++)
{
while(B[i]!=A[j+1]&&j>0)
j=V[j];
if(B[i]==A[j+1])
j++;
if(j==na)
{
j=V[j];
sol++;
if(sol<=1000)
S[sol]=i-na;
}
}
fout<<sol<<"\n";
minim=min(1000,sol);
for(i=1;i<=minim;i++)
fout<<S[i]<<" ";
return 0;
}