【模板】Hash

洛谷3370

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

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