Pagini recente » Cod sursa (job #2444069) | Cod sursa (job #1233863) | Cod sursa (job #2682519) | Cod sursa (job #2484750) | Cod sursa (job #2963214)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
#define minim(a, b) ((a < b) ? a : b)
int m, n;
char a[2000005], b[2000005];
int pi[2000005], 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(void)
{
int i, q = 0, nr = 0;
f>>a;
f>>b;
m=strlen(a);
n=strlen(b);
for (i = m; i; --i) a[i] = a[i-1]; a[0] = ' ';
for (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];
++nr;
if (nr <= 1000)
pos[nr] = i-m;
}
}
g<<nr<<'\n';
for (i = 1; i <= minim(nr, 1000); ++i)
g<<pos[i]<<" ";
g<<'\n';
return 0;
}