Pagini recente » Cod sursa (job #242771) | Cod sursa (job #118642) | Cod sursa (job #2835826) | Cod sursa (job #2679356) | Cod sursa (job #1380806)
#include<fstream>
#include<cstring>
using namespace std;
int n, m, i, L, p[2000003], sol, x[1003];
char a[2000003], b[2000003];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
in>>a+1;
n=strlen(a+1);
for(i=2; i<=n; i++){
while(L!=0 && a[i]!=a[L+1])
L=p[L];
if(a[i]==a[L+1])
L++;
p[i]=L;
}
in>>b+1;
m=strlen(b+1);
L=0;
for(i=1; i<=m; i++){
while(L!=0 && b[i]!=a[L+1])
L=p[L];
if(b[i]==a[L+1])
L++;
if(L==n){
sol++;
if(sol<=1000)
x[sol]=i-n;
L=p[L];
}
}
out<<sol<<"\n";
for(i=1; i<=min(1000, sol); i++)
out<<x[i]<<" ";
return 0;
}