Cod sursa(job #1761930)

Utilizator DobosDobos Paul Dobos Data 23 septembrie 2016 08:43:43
Problema Abc2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.16 kb
#include <bits/stdc++.h>

const int NMAX = 1e9;
const int MOD = 70853;
typedef long long var;

using namespace std;

ifstream fin("abc2.in");
ofstream fout("abc2.out");
vector < var > H[MOD];

string S,s;
bitset < NMAX > F;
var P[20];

int Hash(const var &x){
    int r = 0;
    for(int i = 0; i < H[x % NMAX].size(); i++){
        if(H[x % NMAX][i] == x)
            r++;
    }

    return r;

}
int Tr(const char &x){
    return x - 'a';
}

int main()
{
    ios :: sync_with_stdio(false);
    fin.tie(NULL);
    P[0] = 3;
    for(int  i = 1; i < 20 ; i++)
        P[i] = P[i - 1] * 3;
    fout << P[19] << " ";
    fin >> S >> s;
    int n = S.size(), m = s.size(), r = 0;
    var a;
    for(int  i = 0; i <= n - m; i++){
        a = 0;
        for(int j = 0,k = i; j < m; j++,k++){
            a += Tr(S[k]) * P[j];
        }
        H[a % MOD].push_back(a);
    }
    do{
        a = 0;
        for(int i = 0; i < m; i++){
            a += Tr(s[i]) * P[i];
        }
        if(F[a] == 0){
          r += Hash(a);
          F[a] = 1;
        }
        s.clear();

    }while(fin >> s);

    fout << r;

    return 0;
}