Cod sursa(job #2809578)

Utilizator Kawaiimeatball13Russu Mihaela Kawaiimeatball13 Data 27 noiembrie 2021 10:59:48
Problema Potrivirea sirurilor Scor 18
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.77 kb
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

struct Hash{
    long long n, m, power, value;

    Hash(){
        n = 0;
        m = 0;
        power = 0;
        value = 0;
    }

    void init(char* s, long long len)
    {
        power = 1;
        value = 0;
        for(long long i = len - 1; i >= 0; --i)
        {
            value = (value + (1LL * power * s[i]) % m) % m;
            if(i)
                power = (power * n) % m;
        }
    }

    void roll(char toRemove, char toAdd)
    {
        value = (((value - (1LL * toRemove * power) % m + m)* n)% m + toAdd) % m;
    }
};

char a[1001];
char b[1001];
Hash b1, b2;
Hash a1, a2;
int la, lb;
int rez[1001], k;

void initial()
{
    b1.n = 31;
    b1.m = 40099;
    b1.init(b, lb);
    b2.n = 53;
    b2.m = 319993;
    b2.init(b, lb);
    a1.n = 31;
    a1.m = 40099;
    a1.init(a, lb);
    a2.n = 53;
    a2.m = 319993;
    a2.init(a, lb);
}



int main()
{
    fin.getline(b, 1001);
    fin.getline(a, 1001);
    la = strlen(a);
    lb = strlen(b);
    initial();
    if(b1.value == a1.value && b2.value == a2.value)
        rez[k++] = 0;
    for(int i = lb; i < la; ++i)
    {
        a1.roll(a[i - lb], a[i]);
        a2.roll(a[i - lb], a[i]);
        //fout << a1.value << ' ' << b1.value << '\n';
        //fout << a2.value << ' ' << b2.value << '\n';
        if(a1.value == b1.value && a2.value == b2.value)
            if(k < 1000)
                rez[k++] = i - lb + 1;
            else
                k++;
    }
    fout << k << '\n';
    if(k >= 1000)
        k = 999;
    for(int i = 0; i < k; ++i)
        fout << rez[i] << ' ';
    return 0;
}