Cod sursa(job #1435451)

Utilizator FlorinHajaFlorin Gabriel Haja FlorinHaja Data 13 mai 2015 11:17:53
Problema Potrivirea sirurilor Scor 38
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include <fstream>
#include <cstring>
using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

char a[2000001], b[2000001];
int m, n, i, j, k, q;
int p[2000001], rez[2222];

void prefixare()
{
    int q = 0, i;
    for (i = 2; i <= m; i++)
    {
        while (q && a[q+1] != a[i])
            q = p[q];
        if (a[q+1] == a[i])
            q++;
        p[i] = q;
    }
}

int main()
{
    f.get(a, sizeof(a));
    f.get();
    f.get(b, sizeof(b));

    for (; (a[m] >= 'A' && a[m] <= 'Z') || (a[m] >= 'a' && a[m] <= 'z') || (a[m] >= '0' && a[m] <= '9'); m++);
    for (; (b[n] >= 'A' && b[n] <= 'Z') || (b[n] >= 'a' && b[n] <= 'z') || (b[n] >= '0' && b[n] <= '9'); n++);

    for (i = m; i >= 1; i--)
        a[i] = a[i-1];
    a[0] = ' ';
    for (i = n; i >= 1; i--)
        b[i] = b[i-1];
    b[0] = ' ';

    prefixare();

    q = 0;
    for (i = 2; i <= n; i++)
    {
        while (q && a[q+1] != b[i])
            q = p[q];
        if (a[q+1] == b[i])
            q++;
        if (q == m)
            q = p[q], k++, rez[k] = i-m;
    }

    g << k << "\n";
    for (i = 1; i <= k; i++)
        g << rez[i] << " ";
    return 0;
}