Pagini recente » Cod sursa (job #2388981) | Cod sursa (job #919449) | Cod sursa (job #1375387) | Cod sursa (job #94186) | Cod sursa (job #653496)
Cod sursa(job #653496)
#include<fstream>
#include<cstring>
#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005
using namespace std;
ifstream f("strmatch.in",fstream::in);
ofstream g("strmatch.out",fstream::out);
int M, N;
char A[NMax], B[NMax];
int pi[NMax], sol[1024];
void next(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(void)
{
int i, q = 0, n = 0;
f.getline(A+1, sizeof(A));
f.getline(B+1, sizeof(B));
N=strlen(B+1);
M=strlen(A+1);
A[0]=' ';
B[0]=' ';
next();
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)
sol[n] = i-M;
}
}
g<<n<<"\n";
for (i = 1; i <= minim(n, 1000); ++i)
g<<sol[i]<<" ";
f.close();
g.close();
return 0;
}