Pagini recente » Cod sursa (job #2223326) | Cod sursa (job #114711) | Cod sursa (job #83002) | Cod sursa (job #2089925) | Cod sursa (job #1438678)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005], b[2000005];
int i, j, n, q, l1, l2;
int cach[2000001], sol[1024];
int main()
{
f.getline(a, sizeof(a));
l1 = strlen(a);
f.getline(b, sizeof(b));
l2 = strlen(b);
for (i = l1; i >= 1; i--)
a[i] = a[i-1];
for (i = l2; i >= 1; i--)
b[i] = b[i-1];
a[0] = b[0] = ' ';
for (i = 2; i <= l1; i++)
{
while (q && a[q+1] != a[i])
q = cach[q];
if (a[q+1] == a[i])
q++;
cach[i] = q;
}
q = 0, cach[1] = 0;
for (i = 1; i <= l2; i++)
{
while (q && a[q+1] != b[i])
q = cach[q];
if (a[q+1] == b[i])
q++;
if (q == l1)
{
q = cach[q];
n++;
if (n <= 10*10*10) sol[n] = i-l1;
}
}
g << n << "\n";
for (i = 1; i <= min(n, 1000); i++)
g << sol[i] << " ";
return 0;
}