Cod sursa(job #1539634)

Utilizator MarghescuGabriel Marghescu Marghescu Data 1 decembrie 2015 07:49:34
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
#include <fstream>
#include <cstring>
#define M1 100007
#define M2 100021
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000001],b[2000001];
int v[1001],p=257;
int main()
{
    int hashA=0,hashB=0,nr=0,hashA2=0,hashB2=0;
    f.getline(a,2000001);
    f.getline(b,2000001);
    int length=strlen(a);
    int power=length-1;
    int p1=1,p2=1;
    for(int i=0;i<length;i++)
    {
        hashA=(hashA*p+(int)a[i])%M1;
        hashA2=(hashA2*p+(int)a[i])%M2;
        hashB=(hashB*p+(int)b[i])%M1;
        hashB2=(hashB2*p+(int)b[i])%M2;
        if(i!=0)
        {
            p1=(p1*p)%M1;
            p2=(p2*p)%M2;
        }
    }
    int k=0;
    if(hashA==hashB&&hashA2==hashB2)
    {
        nr++;
        v[++k]=0;
    }
    int lengthB=strlen(b);
    for(int i=length;i<lengthB;i++)
    {
        hashB=((hashB-(b[i-length]*p1)%M1+M1)*p+b[i])%M1;
        hashB2=((hashB2-(b[i-length]*p2)%M2+M2)*p+b[i])%M2;
        if(hashB==hashA&&hashA2==hashB2)
        {
            nr++;
            v[++k]=i-length+1;
        }
    }
    g<<nr<<"\n";
    for(int i=1;i<=k&&k<=1000;i++)
        g<<v[i]<<" ";
    return 0;
}