BOJ 31636 - 三連続 (Three Consecutive) [C++]

문제

링크

풀이

#include <iostream>
#include <string>
using namespace std;
 
bool solve(void) {
  int n; cin >> n;
  string s; cin >> s;
 
  return s.find("ooo") != string::npos;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  cout << (solve() ? "Yes" : "No");
  return 0;
}