Pagini recente » Cod sursa (job #1437980) | Cod sursa (job #1597377) | Cod sursa (job #1163154) | Cod sursa (job #2358433) | Cod sursa (job #1340012)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,i,l1,l2,m,p[2000005],v[2000005],nr,x;
char A[2000005],B[2000005];
int main(){
fin>>A+1;
n=strlen(A+1);
fin>>B+1;
m=strlen(B+1);
l1=0;p[1]=0;
for(i=2;i<=n;i++){
while(l1!=0 && A[i]!=A[l1+1]){
l1=p[l1];
}
if(A[i]==A[l1+1]){
l1++;
}
p[i]=l1;
}
for(i=1;i<=m;i++){
while(l2!=0 && B[i]!=A[l2+1]){
l2=p[l2];
}
if(B[i]==A[l2+1]){
l2++;
}
if(l2==n){
nr++;
l2=p[l2];
v[++x]=i-n;
}
}
fout<<nr<<"\n";
for(i=1;i<=x;i++){
fout<<v[i]<<" ";
}
return 0;
}