Aramic script（cf 975A）

最新推荐文章于 2022-05-17 10:46:16 发布

Baiyi_destroyer

最新推荐文章于 2022-05-17 10:46:16 发布

阅读量478

点赞数

分类专栏：水题集

本文链接：https://blog.csdn.net/Baiyi_destroyer/article/details/81737499

版权

水题集专栏收录该内容

98 篇文章

订阅专栏

探讨一种古代语言阿米克语中单词的特殊属性，如何通过去除重复字母找到单词的'根'，并统计不同对象的数量。使用C++实现算法，通过映射存储根单词来计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 xx of a word yy is the word that contains all letters that appear in yy in a way that each letter appears once. For example, the rootof "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 nn (1≤n≤1031≤n≤103) — the number of words in the script.

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

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

input

3
amer arem mrea

output

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".

题解：给多个字符串，对于每个字符串，找出它的“Root”，即不考虑重复的字母，所有的字符串共有几个不同的“根”；

代码如下：

#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>
#define maxn 10007
#define N 107
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define eps 0.000000001
#define mod 1000000007
using namespace std;
typedef long long ll;

int main()
{
    int n,ans=0;
    cin>>n;
    string tmp;
    map<string,int>mp;
    while(n--)
    {
        cin>>tmp;
        char a[1000]= {'\0'},cnt=0;
        int vis[28]= {0};
        for(int i=0; i<tmp.size(); i++)
        {
            vis[tmp[i]-'a']++;
        }
        for(int i=0; i<26; i++)
        {
            if(vis[i]!=0)
                a[cnt++]=i+'a';
        }
        string s=a;
        if(mp[s]==0)
        {
            mp[s]++;
            ans++;
        }
    }
    printf("%d\n",ans);
    return 0;
}