Pagini recente » Cod sursa (job #1107116) | Cod sursa (job #2702205) | Cod sursa (job #1182896) | Cod sursa (job #938605) | Cod sursa (job #2231395)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int maxn=2000004;
char sirA[maxn],sirB[maxn];
int M,N,pi[maxn],pos[1026];
void prefix(){
M=strlen(sirA);
int i,q=0;
pi[1]=0;
for(i=2,pi[1]=0;i<=M;++i){
while(q&&sirA[q+1]!=sirA[i])
q=pi[q];
if(sirA[q+1]==sirA[i])
++q;
pi[i]=q;
}
}
int main(){
fin.getline(sirA,maxn);
fin.getline(sirB,maxn);
N=strlen(sirB);
int q=0,n=0;
prefix();
for(int i=1;i<=N;++i){
while(q&&sirA[q+1]!=sirB[i])
q=pi[q];
if(sirA[q+1]==sirB[i])
++q;
if(q==M){
q=pi[M];
++n;
if(n<=1000)
pos[n]=i-M;
}
}
fout<<n<<'\n';
for(int i=1;i<=min(n,1000);++i)
fout<<pos[i]<<' ';
return 0;
}