[SW Expert Academy] 4406 모음이 보이지 않는 사람 [C++]

[ 핵심풀이 ]

[ 핵심소스 ]

[ C++ ]

#include <iostream>
#include <string>
using namespace std;

#define endl "\n"
#define tap "\t"
#define MAX 27

bool alpha[MAX];
int main() {
    int tc;
    cin >> tc;

    alpha['a' - 'a'] = true;
    alpha['e' - 'a'] = true;
    alpha['i' - 'a'] = true;
    alpha['o' - 'a'] = true;
    alpha['u' - 'a'] = true;
    for (int t = 1; t <= tc; t++) {
        string temp;
        cin >> temp;
        cout << "#" << t << " ";
        for (int i = 0; i < temp.length(); i++)
            if (!alpha[temp[i] - 'a']) cout << temp[i];
        cout << endl;
    }
}