1759번: 암호 만들기

가볍게 풀 수 있는 문제

#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
 
int main(void) {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
 
    int len, N;
    std::cin >> len >> N;
 
    std::vector<char> alphabet(N);
    for (int i = 0; i < N; i++) {
        std::cin >> alphabet[i];
    }
 
    std::vector<std::string> total;
    std::queue<std::pair<std::string, int>> mQ;
    mQ.push({ "", 0 });
    while (!mQ.empty()) {
        std::string key = mQ.front().first;
        int count = mQ.front().second;
        mQ.pop();
 
        if (key.size() == len) {
            int consonant = 0, vowel = 0;
            for (int i = 0; i < len; i++) {
                if (key[i] == 'a' || key[i] == 'i' || key[i] == 'e' || key[i] == 'o' || key[i] == 'u') {
                    vowel++;
                }
                else {
                    consonant++;
                }
            }
            if (consonant >= 2 && vowel >= 1) {
                total.push_back(key);
            }
            continue;
        }
        
        for (int i = 0; i < N; i++) {
            if ((key.size() >= 1 && key[key.size() - 1] < alphabet[i]) || key.size() < 1) {
                mQ.push({ key + alphabet[i], count + 1 });
            }
        }
    }
 
    std::sort(total.begin(), total.end());
    for (int i = 0; i < total.size(); i++) {
        std::cout << total[i] << "\n";
    }
    return 0;
}