BOJ 9287 - Jenga [C++]

문제

링크

풀이

#include <iostream>
#include <string>
#include <vector>
using namespace std;
 
bool solve(void) {
  int n; cin >> n;
  vector<string> v(n);
  for (int i=0; i<n; i++) cin >> v[i];
 
  for (int i=0; i<n; i++) {
    if (v[i] == "000" || v[i] == "100" || v[i] == "001") return true;
  }
  return false;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t; cin >> t;
  for (int i=1; i<=t; i++) cout << "Case " << i << ": " << (solve() ? "Fallen" : "Standing") << "\n";
  return 0;
}