Pagini recente » Cod sursa (job #2165884) | Cod sursa (job #1433068) | Cod sursa (job #1092979) | Cod sursa (job #2220517) | Cod sursa (job #2563771)
#include <bits/stdc++.h>
#define DIM 2000010
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,m,k,i,p[DIM],cnt,sol[1010];
char A[DIM],B[DIM];
int main() {
fin>>(A+1);
fin>>(B+1);
n=strlen(A+1), m=strlen(B+1);
for (i=2;i<=n;i++) {
while (k&&A[k+1]!=A[i])
k=p[k];
if (A[k+1]==A[i])
k++;
p[i]=k;
}
k=0;
for (i=1;i<=m;i++) {
while (k&&A[k+1]!=B[i])
k=p[k];
if (A[k+1]==B[i])
k++;
if (k==n) {
cnt++;
if (cnt<=1000)
sol[cnt]=i-n;
}
}
fout<<cnt<<"\n";
for (i=1;i<=min(cnt,1000);i++)
fout<<sol[i]<<" ";
return 0;
}