Submission #3388886

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int init();
int solve();

#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i >= (int) (b); i--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define TRUE__  "Yes"
#define FALSE__ "No"
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x

#define MOD 1000000007
#define PI 3.141592653589793238462643383

signed main()
{
	init();
	solve();
}

string s;

int init()
{
	cin >> s;
}

int solve()
{
	string aki = "AKIHABARA";
	int pos = 0;
	rep(i, s.length()) {
		if (pos >= (int) aki.length()) {
			cout << "NO" << endl;
			return 0;
		}
		while (aki[pos] != s[i] && aki[pos] == 'A') pos++;
		if (aki[pos] != s[i]) {
			cout << "NO" << endl;
			return 0;
		}
		pos++;
	}
	cout << "YES" << endl;
}

Submission Info

Judge Result