Submission #2251911

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,n) for(int i=1;i<=(int)(n);i++)
#define rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#define repll(i,n) for(ll i=0;i<(ll)(n);i++)
#define repll2(i,n) for(ll i=1;i<=(ll)(n);i++)
#define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++)
#define INF 1000000000 //
#define LINF (ll)4000000000000000000 //
#define MOD (ll)1000000007
#define MP make_pair
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE"  ) << endl
#define PI 3.1415926535898
#define NP(v) next_permutation(v.begin(),v.end())

//------------------------------------------------------

int main() {
    string s;
    cin >> s;
    vector<string> v;

    rep(i, 16) {
        int j = i;
        int a, b, c, d;
        d = j % 2;
        j /= 2;
        c = j % 2;
        j /= 2;
        b = j % 2;
        j /= 2;
        a = j;
        string t;
        if (a == 1) t.push_back('A');
        t += "KIH";
        if (b == 1) t.push_back('A');
        t.push_back('B');
        if (c == 1) t.push_back('A');
        t.push_back('R');
        if (d == 1) t.push_back('A');
        v.push_back(t);
    }

    bool can = false;

    rep(i, 16) {
        if (s == v[i]) can = true;
    }

    YES(can);

    return 0;
}

Submission Info

Judge Result