codeforces-975A

题目传送门
In Aramic language words can only represent objects.

Words in Aramic have special properties:

A word is a root if it does not contain the same letter more than once.
A root and all its permutations represent the same object.
The root x of a word y is the word that contains all letters that appear in y in a way that each letter appears once. For example, the root of “aaaa”, “aa”, “aaa” is “a”, the root of “aabb”, “bab”, “baabb”, “ab” is “ab”.
Any word in Aramic represents the same object as its root.
You have an ancient script in Aramic. What is the number of different objects mentioned in the script?

Input
The first line contains one integer n (1≤n≤103) — the number of words in the script.

The second line contains n words s1,s2,…,sn — the script itself. The length of each string does not exceed 103.

It is guaranteed that all characters of the strings are small latin letters.

Output
Output one integer — the number of different objects mentioned in the given ancient Aramic script.

Examples
Input
5
a aa aaa ab abb
Output
2
Input
3
amer arem mrea
Output
1
Note
In the first test, there are two objects mentioned. The roots that represent them are “a”,“ab”.

In the second test, there is only one object, its root is “amer”, the other strings are just permutations of “amer”.

题意很简单：
一道可以用map的题目，也可以用set。

#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
using namespace std;
bool cmp(char a,char b)
{
   
    return int(a)<int(b);//char排序cmp函数
}
int main()
{
   
    map<string,bool>ma;
    int n,cnt=0;
    string q;
    cin>>n;
    for(int i=1; i<=n; i++)
    {
   
        cin>>q;
        bool p[501];
        fill(p+1,p+500,0);
        char w[1001];
        int top=0;
        string e;
        int len=q.length();
        for(int j=0; j<len; j++)
        {
   
            if(!p[q[j]])
            {
   
                p[q[j]]=1;
                w[++top]=q[j];//存每个不同字母
            }
        }
        sort(w+1,w+top+1,cmp);//字典序排序
        for(int i=1; i<=top; i++)
        {
   
            e+=w[i];//转化成string
        }
        if(ma[e]==0)
        {
   
            cnt++;
            ma[e]=1;
        }
    }
    cout<<cnt;
    return 0;
}