Pagini recente » Cod sursa (job #298409) | Cod sursa (job #2115707) | Cod sursa (job #2854986) | Cod sursa (job #318148) | Cod sursa (job #2259226)
#include <stdio.h>
#include <string.h>
#define MAX 2000005
#define THRESH 1000
char a[MAX], b[MAX];
int n, m, k, cnt, pi[MAX];
int main() {
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
scanf("%s\n%s", a + 1, b + 1);
n = strlen(a + 1);
m = strlen(b + 1);
k = 0;
for (int i = 2; i <= n; ++i) {
while (k && a[i] != a[k + 1])
k = pi[k];
if (a[k + 1] == a[i])
++k;
pi[i] = k;
}
k = 0;
for (int i = 1; i <= m; ++i) {
while (k && b[i] != a[k + 1])
k = pi[k];
if (b[i] == a[k + 1])
++k;
if (k == n) {
++cnt;
printf("%d ", i - n);
if (cnt == THRESH)
break;
}
}
printf("\n");
return 0;
}