【模板】Hash

洛谷3370

这题煞笔的吧QAQ......排序去重或者Map都可以

#include<cstdio>
#include<map>
#include<string>
using namespace std;
map<int, int> dic;
int ans=0,n;
int main() {
    scanf("%d
",&n);
    for (int i=1;i<=n;i++) {
        char c=getchar();
        int x=0;
        while (c!='
'){
            x=x*2333+c-'a';
            c=getchar();
        }
        if (!dic.count(x)) {
            ans++;
            dic[x]=i;
        }
    }
    printf("%d",ans);
    return 0;
}