Codeforces Round #253 (Div. 2) A. Anton and Letters
2014-06-20 17:11
567 查看
题目很简单,只需要注意带空格的输入用getline即可
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> using namespace std; int main(){ string str; getline(cin,str); set<char> a; for(int i= 1 ; i < str.length()-1; i+=3 ){ a.insert(str[i]); } cout<<a.size()<<endl; }
相关文章推荐
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- Codeforces Round #253 (Div. 2) A. Anton and Letters
- Codeforces Round #253 (Div. 2)A. Anton and Letters
- Codeforces Round #253 (Div. 2)A. Anton and Letters
- Codeforces Round #379 (Div. 2) F. Anton and School
- Codeforces Round #324 (Div. 2) E. Anton and Ira 贪心
- Codeforces Round #379 (Div. 2) D. Anton and Chess 模拟
- Codeforces Round #253 (Div. 1) A. Borya and Hanabi 暴力
- Codeforces Round #379 (Div. 2) C. Anton and Making Potions 枚举+二分
- Codeforces Round #253 (Div. 2) D. Andrey and Problem
- Codeforces Round #379 (Div. 2) E. Anton and Tree
- Codeforces Round #404 (Div. 2) D. Anton and School - 2(组合数学)
- Codeforces Round #404 (Div. 2) D. Anton and School - 2 排列组合好题
- Codeforces Round #253 (Div. 2) D. Andrey and Problem (贪心+数学概率)
- Codeforces Round #379 (Div. 2) F. Anton and School
- Codeforces Round #379 (Div. 2) B. Anton and Digits(简单贪心)
- Codeforces Round #404 (Div. 2) D. Anton and School - 2 前缀的后缀、 范德蒙恒等式、容斥
- Codeforces Round #253 (Div. 2) B - Kolya and Tandem Repeat
- Codeforces Round #379 (Div. 2)E. Anton and Tree
- Codeforces Round #253 (Div. 1) A Borya and Hanabi