Submission #1368035

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <sstream>
#include <algorithm>
using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000000;
 
int main() {
  string s;
  cin >> s;
  bool ck=true;
  for(int i=0; i<4; i++) {
    if(i==2) {
      if(!(s[i]=='A' || s[i]=='D' || s[i]=='O' || s[i]=='P' || s[i]=='Q' || s[i]=='R')) ck=false;
    } else {
      if(s[i]=='A' || s[i]=='D' || s[i]=='O' || s[i]=='P' || s[i]=='Q' || s[i]=='R' || s[i]=='B') ck=false;
    }
  }
  if(ck) cout << "yes" << endl;
  else cout << "no" << endl;
  return 0;
}

Submission Info

Judge Result