Codeforces Round #478 (Div. 2)

掉分场，第四题应该细心下来算一下样例

A. Aramic script

题目大意：给定n个字符串，统计有多少不同的字符串，字符串不同当且仅当出现的字符（不考虑次数）不同，只有小写字母。
题解：hash一下，丢进Set里

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b)  for(int i=(a); i<(b); i++)
#define REP(i, a, b)  for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N= 5e4 +10;

int n;
ll t;
int len;
set<ll> S;
string s;
ll w[30], vis[30];

int main() {
    cin>>n;
    w[0]=1;
    FOR(i, 1, 26) w[i]=w[i-1]*2;
    REP(i, 1, n) {
        cin>>s;
        len=s.length();
        memset(vis, 0, sizeof(vis));
        FOR(j, 0, len) {
            vis[s[j]-'a']=1;
        }
        t=0;
        FOR(j, 0, 26) {
            t+=vis[j]*w[j];
        }
        S.insert(t);
    }
    cout<<S.size()<<endl;
    //cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
    return <