Pagini recente » Cod sursa (job #2595395) | Cod sursa (job #2503990) | Istoria paginii utilizator/volines50 | Cod sursa (job #2661054) | Cod sursa (job #627191)
Cod sursa(job #627191)
#include <fstream.h>
#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005
int M, N;
char A[NMax], B[NMax];
int pi[NMax], pos[1024];
void make_prefix(void)
{
int i, q = 0;
for (i = 2, pi[1] = 0; i <= M; ++i)
{
while (q && A[q+1] != A[i])
q = pi[q];
if (A[q+1] == A[i])
++q;
pi[i] = q;
}
}
int main()
{
int i, q = 0, n = 0;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
fin.getline(A,100);
fin.getline(B,100);
M=strlen(A); N=strlen(B);
for (int i = M; i; --i) A[i] = A[i-1]; A[0] = ' ';
for (int i = N; i; --i) B[i] = B[i-1]; B[0] = ' ';
make_prefix();
for (i = 1; i <= N; ++i)
{
while (q && A[q+1] != B[i])
q = pi[q];
if (A[q+1] == B[i])
++q;
if (q == M)
{
q = pi[M];
++n;
if (n <= 1000)
pos[n] = i-M;
}
}
fout<<n<<'\n';
for (i = 1; i <= minim(n, 1000); ++i)
fout<<pos[i]<<' ';
fout<<'\n';
return 0;
}