Submission #4249802

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<string> vst;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
 
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};


struct k{
    int s,e;
};

bool asc( const k& left, const k& right ) {
    return left.s < right.s;
}

int main(){
    string s;
    cin >> s;

    int i=0,j=1;
    while(i<s.size()){
        if(s[i]=='a'|| s[i]=='i' || s[i]=='u' || s[i]=='e' || s[i]=='o'){
            s.erase(s.begin()+i);
        }
        else{
            i++;
        }
    }

    cout << s << endl;

    return 0;
}

Submission Info

Judge Result