Cod sursa(job #1319652)

Utilizator retrogradLucian Bicsi retrograd Data 17 ianuarie 2015 12:01:18
Problema Potrivirea sirurilor Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.62 kb
#include<fstream>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<ctime>

#define MAXN 2000005

#define P1 124567
#define P2 120551

using namespace std;

typedef long long var;



char WORD[MAXN];
var nrw;
var r1w, r2w, r1t, r2t;
var SOL[1004];
var L1, L2, POW1, POW2;


int main() {

    char c;
    srand(time(NULL));
    var i;

    freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);

    const var B1 = rand()%45 + 130;
    const var B2 = rand()%45 + 163;
    scanf("%s ", &WORD);
    POW1 = POW2 = 1;
    nrw = strlen(WORD);
    for(i=0; WORD[i]; i++) {
        r1w = (r1w * B1 + WORD[i]) % P1;
        L1 = POW1;
        L2 = POW2;
        POW1 = (POW1*B1)%P1;
        POW2 = (POW2*B2)%P2;
        r2w = (r2w * B2 + WORD[i]) % P2;
    }
    scanf("%s ", &WORD);
    for(i=0; i<nrw; i++) {
        r1t = (r1t * B1 + WORD[i]) % P1;
        r2t = (r2t * B2 + WORD[i]) % P2;
    }

    var s=0;
    var e = i;
    var sol = 0;

    if( r1t == r1w && r2t == r2w ) {
        sol++;
        SOL[sol] = 0;
    }
    for(; WORD[e];) {
        r1t = (r1t - (WORD[s]*L1)%P1 + P1) % P1;
        r2t = (r2t - (WORD[s]*L2)%P2 + P2) % P2;
        r1t = (r1t * B1 + WORD[e]) % P1;
        r2t = (r2t * B2 + WORD[e]) % P2;
        if( r1t == r1w && r2t == r2w ) {
            sol++;
            if(sol <= 1000)
                SOL[sol] = s+1;
        }
        e++;
        s++;
    }

    printf("%lld \n", sol);
    sol = min(sol, (var)1000);
    for(i=1; i<=sol; i++) {
        printf("%lld ", SOL[i]);
    }
    return 0;
}