Pagini recente » Cod sursa (job #92360) | Cod sursa (job #1595723) | Cod sursa (job #3273575) | Cod sursa (job #556455) | Cod sursa (job #1448154)
#include<fstream>
#include<cstring>
using namespace std;
int n, m, i, L, p[2000003], nrsol, sol[1003];
char a[2000003], b[2000003];
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main(){
in>>a+1;
in>>b+1;
n=strlen(a+1);
m=strlen(b+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;
}
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){
nrsol++;
if(nrsol<1001)
sol[nrsol]=i-n;
L=p[L];
}
}
out<<nrsol<<"\n";
for(i=1; i<=min(1000,nrsol); i++)
out<<sol[i]<<" ";
return 0;
}