Submission #1269789

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

bool used[5];

int main()
{
	string s;
	bool flag = true;
	cin >> s;
	string r = "yahoo";
	for(int i=0;i<s.length();i++){
		bool hoge = false;
		for(int j=0;j<r.length();j++){
			if(s[i] == r[j] && used[j] == false){
				used[j] = true;
				hoge = true;
				break;
			}
		}
		if(!hoge){
			flag = false;
			break;
		}
	}
	if(flag){
		cout << "YES\n";
	}else{
		cout << "NO\n";
	}
	return 0;
}

Submission Info

Judge Result