A. Anton and Letters Codeforces Round #253 (Div. 2) set 应用

set 应用

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;typedef long long ll;const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;char s[77777];set<char> st;int main() {    gets(s);    int len = strlen(s);    for(int i = 0; i < len; ++i)        if(s[i] >= 'a' && s[i] <= 'z') st.insert(s[i]);    cout << st.size() ;    return 0;}