Pagini recente » Cod sursa (job #2963840) | Cod sursa (job #2920153) | Cod sursa (job #3140640) | Cod sursa (job #1986087) | Cod sursa (job #152050)
Cod sursa(job #152050)
#include <stdio.h>
#include <string.h>
#define NX 2000010
char A[ NX ], B[ NX ];
int M, N, pi[ NX ], sol[ NX ], i, k;
void cit() {
scanf( "%s %s", B + 1, A + 1 );
M = strlen( A + 1 );
N = strlen( B + 1 );
}
void calc_pi() {
int i, k;
for( k = pi[0] = -1, i = 1; i <= N; pi[ i++ ] = ++k )
while( B[ i ] != B[ k+1] && k != -1 )
k = pi[k];
}
void rez() {
// int i, k;
calc_pi();
for( k = 0, i = 1; i <= M; i++ ) {
while( A[i] != B[ k+1 ] && k != -1 )
k = pi[k];
if( ++k == N )
sol[ ++sol[0] ] = i - N;
}
}
void scr() {
int i, min = 1000 < sol[0] ? 1000 : sol[0];
printf( "%d\n", sol[0] );
for( i = 1; i <= min; i++ )
printf( "%d ", sol[i] );
}
int main() {
freopen( "strmatch.in", "r", stdin );
freopen( "strmatch.out", "w", stdout );
cit();
rez();
scr();
return 0;
}