BOJ 14038 - Tournament Selection [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  vector<char> v(6);
  for (int i=0; i<6; i++) cin >> v[i];
 
  int cnt = 0;
  for (int i=0; i<6; i++) {
    if (v[i] == 'W') cnt++;
  }
  cout << (cnt == 0 ? -1 : (8-cnt)/2);
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}