Pagini recente » Cod sursa (job #1441593) | Cod sursa (job #1021962) | Cod sursa (job #2811121) | Cod sursa (job #1459538) | Cod sursa (job #1219617)
#include <iostream>
#include <string>
#define maxN 4000050
#define minim(a, b) ((a < b) ? a : b)
using namespace std;
string S1,S2;
int Pi[maxN],Answer[maxN];
int i,A,B,sol,k(0);
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
getline(cin,S1);
getline(cin,S2);
A=S1.size();
S1+='#'+S2;
Pi[0]=0;
for (i=1;i<S1.size();++i)
{
while (k>0 && S1[i]!=S1[k]) k=Pi[k-1];
if (S1[i]==S1[k]) ++k;
Pi[i]=k;
}
for (i=A+1;i<=S1.size()-1;++i)
if (Pi[i]==A){
Answer[++sol]=i-2*A;
if (sol==1000) break;
}
cout<<sol<<"\n";
for (i=1;i<=min(sol,1000);++i)
cout<<Answer[i]<<" ";
return 0;
}