Pagini recente » Cod sursa (job #253659) | Cod sursa (job #2221451) | Cod sursa (job #2536513) | Cod sursa (job #3209490) | Cod sursa (job #621983)
Cod sursa(job #621983)
#include <stdio.h>
#include <stdlib.h>
#define NMAX 2000005
int N, M;
char A[NMAX],B[NMAX];
int pi[NMAX];
void calcul_prefix()
{
int k = 0;
int i;
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;
}
}
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
int i, q = 0;
fgets(A, sizeof(A), stdin);
fgets(B, sizeof(B), stdin);
N = strlen(A); M = strlen(B);
for (i=N; i>0; --i)
A[i] = A[i-1];
A[0] = ' ';
for (i=M; i>0; --i)
B[i] = B[i-1];
B[0] = ' ';
calcul_prefix();
for (i=1; i<=m; ++i) {
while ((q>0) && (A[q+1] != B[i]))
q = pi[q];
if (A[q+1] == B[i])
++q;
if (q == n)
printf("Match at %d", i-n+1);
}
return 0;
}