Submission #1372581

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i, first, to) for(int i = first; i < to; ++i)
#define REP(i, first, to) for(int i = first; i <= to; ++i)
#define MyDebug

#ifdef MyDebug
	#define debug(x) cout << #x << " : " << x << endl
	#define debugP(x) cout << x << endl
#else
	#define debug(x)
	#define debugP(x)
#endif

using namespace std;
typedef long long ll;

queue<char> ans;
string s;
string aiueo = "aiueo";
void solve() {
	bool contain;
	cin >> s;
	rep (i, 0, s.size()) {
		contain = false;
		rep(j, 0, aiueo.size()) {
			if (aiueo[j] == s[i]) {
				contain = true;
				break;
			}
		}
		if (!contain) ans.push(s[i]);
	}
	while (!ans.empty()) {
		cout << ans.front();
		ans.pop();
	}
	cout << endl;
}

int main() {
	solve();
	return 0;
}

Submission Info

Judge Result