Pagini recente » Cod sursa (job #1766524) | Cod sursa (job #1023141) | Cod sursa (job #2492196) | Cod sursa (job #1366546) | Cod sursa (job #2562955)
#include <fstream>
#include <iostream>
#include <cstring>
#define dim 2000010
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,m,p[dim],i,j,l,cnt,sol[1010];
char a[dim],b[dim];
int main(){
fin>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
l=0;
for(i=2;i<=n;i++){
while(l && a[l+1]!=a[i])
l=p[l];
if(a[l+1]==a[i])
l++;
p[i]=l;
}
l=0;
for(i=1;i<=m;i++){
while(l && a[l+1]!=b[i])
l=p[l];
if(a[l+1]==b[i])
l++;
if(l==n){
cnt++;
if(cnt<=1000)
sol[cnt]=i-n;
l=p[l];
}
}
fout<<cnt<<"\n";
for(i=1;i<=min(cnt,1000);i++)
fout<<sol[i]<<" ";
return 0;
}