Pagini recente » Cod sursa (job #1334730) | Cod sursa (job #1232676) | Cod sursa (job #1726743) | Cod sursa (job #1559986) | Cod sursa (job #1501319)
#include <stdio.h>
#include <string.h>
#define MAX 2000005
char a[MAX], b[MAX];
int n, m, i, k, pi[MAX], l[MAX], nr;
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;
pi[1] = 0;
for(i = 2; i <= n; i++){
while(k > 0 && a[k + 1] != a[i])
k = pi[k];
if(a[k + 1] == a[i])
k++;
pi[i] = k;
}
k = 0;
for(i = 1; i <= m; i++){
while(k > 0 && a[k + 1] != b[i])
k = pi[k];
if(a[k + 1] == b[i])
k++;
if(k == n){
nr++;
if(nr <= 1000)
l[nr] = i - n;
}
}
printf("%d\n", nr);
for(i = 1; i <= nr; i++)
printf("%d ", l[i]);
printf("\n");
return 0;
}