codeforces-Aramic script

Aramic script

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 $\mathrm{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 $\mathrm{nn (1\le n\le 1031\le n\le 103) —\; the\; number\; of\; words\; in\; the\; script.}$

The second line contains $\mathrm{nn words s1,s2,\dots ,sns1,s2,\dots ,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

Copy

5
a aa aaa ab abb

output

Copy

2

input

Copy

3
amer arem mrea

output

Copy

1

Note

In the first test, there are two objects mentioned. The roots that represent them are "a","ab".

不会用map。。。就很尴尬 写了很大一串

ac代码：

/*#include <iostream>
#include <algorithm>*/
#include<bits/stdc++.h>
using namespace std;
int n;
char a[1010][1010];
char b[1010][1010];
int vis[1010];
int main()
{
    int n;
    char a[1010][1010];
    char b[1010][1010];
    int len;
    cin>>n;
    getchar();
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        vis[i]=1;
    }
    for(int i=0;i<n;i++)
    {
        len=0;
        for(int j=0;;j++)
        {
            if(a[i][j]=='\0')
                break;
            if(len==0)
                {b[i][0]=a[i][j];len=len+1;}
            else
            {
            int key;
            key=0;
            for(int k=0;k<len;k++)
            {
                if(a[i][j]!=b[i][k])
                    key++;
                if(key==len)
                {b[i][len]=a[i][j];len++;}
            }
            }
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(!strcmp(b[i],b[j]))
                vis[j]=0;
        }
    }
    int ans=0;
    int ans1=1;
    for(int i=0;i<n;i++)
    {
        if(vis[i]==0)
            continue;
        for(int j=i+1;j<n;j++)
        {
            if(vis[j]==0)
            continue;
            int leng1,leng2,flag1;
            flag1=0;
            leng1=strlen(b[i]);
            leng2=strlen(b[j]);
            //cout<<leng1<<' '<<leng2<<endl;
            if(leng1!=leng2)
                continue;
            for(int k=0;k<leng1;k++)
            {
                for(int p=0;p<leng2;p++)
                {
                    if(b[i][k]==b[j][p])
                        flag1++;//cout<<flag1<<endl;
                }
            }
            if(flag1==leng1)
                {
                    if(vis[i]==1&&vis[j]==1)
                    {vis[i]=vis[i]+ans1,vis[j]=vis[j]+ans1;ans1++;}
                    else
                    {
                        if(vis[i]!=1)
                            vis[j]=vis[i];
                        else
                            vis[i]=vis[j];
                    }
                }
        }
    }
    int flag2=2,flag3=0;
    for(int i=0;i<n;i++)
    {
        if(vis[i]==1)
            ans++;
    }
    for(int i=0;i<n;i++)
    {
        if(vis[i]>=2)
            flag3=1;
        if(flag2<vis[i])
            flag2=vis[i];
    }
    if(flag3==0)
        cout<<ans<<endl;
    else
    cout<<ans+flag2-1<<endl;
    return 0;
}

后面这个链接是我在网上找到别的菊苣的 果然和别人差距还是相当大 别人20行就搞定而我100行都是泪orz

不说了 我要取学stl了QAQ

https://blog.csdn.net/maosghoul/article/details/80176711