Hash模版

ull base = 127;
ull pw[maxn];
ull a[maxn];
void hash_pre()
{
    a[0] = 0;
    pw[0] = 1;
    for(int i = 1 ; i <= n ; i ++)
    {
        a[i] = a[i - 1] * base + (s[i] - 'a');
        pw[i] = pw[i - 1] * base;
    }
}
ull get(int l, int r)
{
    return (a[r] - pw[r - l + 1] * a[l - 1]);
}