A11695. Aramic script
编程题
普及/提高-
知识点
题目描述
The first line contains one integer $n$ ( $1 \leq n \leq 10^3$ ) — the number of words in the script.
The second line contains $n$ words $s_1, s_2, \ldots, s_n$ — the script itself. The length of each string does not exceed $10^3$ .
It is guaranteed that all characters of the strings are small latin letters.
The second line contains $n$ words $s_1, s_2, \ldots, s_n$ — the script itself. The length of each string does not exceed $10^3$ .
It is guaranteed that all characters of the strings are small latin letters.
输入格式
Output one integer — the number of different objects mentioned in the given ancient Aramic script.
输出格式
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".
In the second test, there is only one object, its root is "amer", the other strings are just permutations of "amer".
输入输出样例
输入 #1
5 a aa aaa ab abb
输出 #1
2
输入 #2
3 amer arem mrea
输出 #2
1
说明/提示
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".
In the second test, there is only one object, its root is "amer", the other strings are just permutations of "amer".