1759번 암호 만들기

 백트래킹 기본 문제.

 

 

#include <iostream>
#include <algorithm>
#define visited true
#define Non_visited false
#define MAX 16
 
using namespace std;
 
char graph[MAX];
int L,C;
 
void dfs(int i, int consonants, int vowels, string str){
    if(str.size()==L){
        if(consonants<2 || vowels<1){
            return;
        }
        cout << str << endl;
    }
    
    while(i<C){
        if(graph[i]=='a' || graph[i]=='e' || graph[i]=='i' || graph[i]=='o' || graph[i]=='u'){
            dfs(i+1,consonants,vowels+1,str+graph[i]);
        }
        else{
            dfs(i+1,consonants+1,vowels,str+graph[i]);
        }
        i++;
    }
}
 
int main(){
    cin >> L >> C;
    
    for(int i=0;i<C;i++){
        cin >> graph[i];
    }
    
    sort(graph,graph+C);
    
    dfs(0,0,0,"");
}