36pts闭关求调

#include<bits/stdc++.h>
using namespace std;
int n;
int a[10005],ans = 1;
char s[10005];
int base = 131;
int mod = 123132;
int prime = 233333;
int has(char s[]){
    int len = strlen(s);
    int ans = 0;
    for(int i = 0;i < len;i++){
        ans = (ans * base + s[i]) % mod + prime;
    }return ans;
}
int main(){
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> s;
        a[i] = has(s);
    }
    sort(a + 1,a + n + 1);
    for(int i = 1;i < n;i++){
        if(a[i] != a[i + 1]){
            ++ans;
        }
    }cout << ans;
    return 0;
}