BOJ 24073 - ビ太郎と IOI (Bitaro and IOI) [C++]

문제

링크

풀이

#include <iostream>
#include <string>
using namespace std;
 
bool solve(void) {
  int n; cin >> n;
  string s; cin >> s;
 
  for (int i=0; i<n-2; i++) for (int j=i+1; j<n-1; j++) for (int k=j+1; k<n; k++) {
    if (s[i] == 'I' && s[j] == 'O' && s[k] == 'I') return true;
  }
  return false;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  cout << (solve() ? "Yes" : "No");
  return 0;
}