单哈希

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<algorithm>
#define ull unsigned long long
using namespace std;
ull base=131,a[10005],mod=212370440130137957ll;
int n,ans=1;
char s[10005];
ull MOD(ull x){
    while(x>=mod){
        x-=mod;
    }
    return x;
}
ull hash(char s[]){
    int len=strlen(s);
    ull sum=0;
    for(int i=0;i<len;i++){
        sum=MOD(sum*base+(ull)s[i]);
    }
    return sum;
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%s",s);
        a[i]=hash(s);
    }
    sort(a+1,a+n+1);
    for(int i=1;i<n;i++){
        if(a[i]!=a[i+1]){
            ans++;
        }
    }
    printf("%d\n",ans);
    return 0;
}

单哈希

原文：https://www.cnblogs.com/ukcxrtjr/p/11647370.html