Pagini recente » Cod sursa (job #1913503) | Cod sursa (job #1654868) | Cod sursa (job #416655) | Cod sursa (job #1083649) | Cod sursa (job #2205058)
#include<cstdio>
#include<cstring>
#define MAX_LEN 2000000
#define MAX_POS 1000
using namespace std;
char P[MAX_LEN+1], T[MAX_LEN+1];
int pi[MAX_LEN], pos[MAX_POS], n, m, l;
int main() {
int i, k;
FILE* fin, *fout;
fin = fopen("strmatch.in","r");
fout = fopen("strmatch.out","w");
fscanf(fin,"%s%s",P,T);
fclose(fin);
n = strlen(T);
m = strlen(P);
k = 0;
for(i = 1; i < m; i++) {
while(k > 0 && P[i] != P[k])
k = pi[k-1];
if(P[i] == P[k])
k++;
pi[i] = k;
}
k = 0;
for(i = 0; i < n; i++) {
while(k > 0 && T[i] != P[k])
k = pi[k-1];
if(T[i] == P[k])
k++;
if(k == m) {
if(l < MAX_POS)
pos[l++] = i - m + 1;
else l++;
}
}
fprintf(fout,"%d\n",l);
if(l > MAX_POS)
l = MAX_POS;
for(i = 0; i < l; i++)
fprintf(fout,"%d ",pos[i]);
fprintf(fout,"\n");
fclose(fout);
return 0;
}