Pagini recente » Cod sursa (job #2016537) | Cod sursa (job #1991472) | Istoria paginii utilizator/malina_florea | Cod sursa (job #1285698) | Cod sursa (job #1692029)
#include<fstream>
#include<string.h>
using namespace std;
ifstream fi("strmatch.in");
ofstream fo("strmatch.out");
char a[2000005],b[2000005];
int pi[2000005],l[1000000];
int main(){
int n,m,c,k;
fi>>a+1;
fi>>b+1;
n=strlen(a+1);
m=strlen(b+1);
k=0;
pi[1]=0;
for(int i=2;i<=n;i++){
while(k!=0&&a[k+1]!=a[i])
k=pi[k];
if(a[i]==a[k+1]) k++;
pi[i]=k;
}
k=0;c=0;
for(int i=1;i<=m;i++){
while(k>0&&b[i]!=a[k+1])
k=pi[k];
if(b[i]==a[k+1]) k++;
if(k==n){
c++;
if(c<=1000)
l[c]=i-n;
k=pi[k];
}
}
fo<<c<<endl;
for(int i=1;i<=min(1000,c);i++)
fo<<l[i]<<" ";
return 0;
}