hihoCoder 1258 Osu! Master [Ad Hoc]

2015 北京区域赛 J题
http://hihocoder.com/problemset/problem/1258

字符串处理，scanf()真的好用
只要把S和C 1,B 1算进去了就好了

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 10000 + 9;
int n;
struct V
{
  char ch;
  int x;
};
V a[MAXN];
void solve() {
  memset(a, 0, sizeof(a));
  for (int i = 0; i < n; i++) {
    scanf("%c", &a[i].ch);
    if (a[i].ch == 'C' || a[i].ch == 'B') {
      scanf(" %d\n", &a[i].x);
    } else {
      a[i].x = 0;
      scanf("\n");
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i].ch == 'S') ans++;
    if (a[i].ch == 'C' && a[i].x == 1) ans++;
    if (a[i].ch == 'B' && a[i].x == 1) ans++;
  }
  printf("%d\n", ans);
}
int main() {
  //freopen("in.txt", "r", stdin);
  while (scanf("%d\n", &n) != EOF) {
    solve();
  }
}