HDU 5842 Lweb and String

看错题意会很坑
其实就是统计不同字符的个数

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<math.h>
#include<set>
#include<stack>
#include<queue>
#include<ctype.h>
#include<vector>
#include<algorithm>
// cout << "  ===  " << endl;

using namespace std;
typedef long long ll;
const int maxn = 100000 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int T, n;
char s[maxn];
int cnt[maxn], l[maxn];
set<int> st;

void solve() {
    memset(cnt, 0, sizeof cnt);
    for(int i = 0; i < n; ++i) {
        cnt[s[i] - 'a']++;
    }
    int ans = 0;
    for(int i = 0; i < 26; ++i)
        if(cnt[i]) ans++;
    cout << ans << endl;
}

int main() {
    scanf("%d", &T);
    int kase = 1;
    while(T--) {
        scanf("%s", s);
        n = strlen(s);
        printf("Case #%d: ", kase++);
        solve();
    }
    return 0;
}