Submission #3026698

---

Source Code Expand

//#include <bits/stdc++.h>
//#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>


#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000

using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;
typedef string::const_iterator State;

int dy[5] = { 0,0,1,-1,0 };
int dx[5] = { 1,-1,0,0 ,0 };




int main(void) {
	
	string s;
	bool flag = true;

	cin >> s;

	FOR(i, 0, 3) {
		if (i == 2) {
			switch (s[i]) {
			case 'A':
			case 'D':
			case 'O':
			case 'P':
			case 'Q':
			case 'R':
				break;
			default:
				flag = false;
			}
		}
		else {
			switch (s[i]) {
			case 'A':
			case 'D':
			case 'O':
			case 'P':
			case 'Q':
			case 'R':
			case 'B':
				flag = false;
			default:
				break;
			}
		}
	}

	if (flag) {
		cout << "yes" << endl;
	}
	else {
		cout << "no" << endl;
	}


	return 0;
}

Submission Info

Judge Result