P3370 【模板】字符串哈希

P3370 【模板】字符串哈希

#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long llu;
const int maxn = 10005;
llu base = 131, mod = 212370440130137957ll;
llu a[maxn];
char s[maxn];
int prime = 233317;
llu hashe(char *s) {
    int len = strlen(s);
    llu ans = 0;
    for (int i = 0; i < len; i++)
        ans = (ans*base+(llu)s[i])%mod+prime;
    return ans;
}
int main() {
    int n; scanf("%d",&n);
    for (int i = 1; i <= n; i++) {
        scanf("%s",s);
        a[i] = hashe(s);
    }
    sort(a+1,a+1+n);
    int ans = 1;
    for (int i = 1; i < n; i++) {
        if (a[i] != a[i+1]) ans++;
    }
    printf("%d\n",ans);
    return 0;
}