알고리즘 풀이/백준

[백준][Java] 1759번 암호 만들기 (백트래킹, 브루트포스)

배게 2021. 10. 4. 13:44
728x90

백트래킹으로 분류 되어 있기는 한데

애초에 주어진 알파벳 문자들을 sort시킨 다음에 풀면 

그냥 브루트포스 완전탐색임

 

sort시키지 않는다는 가정 하에 백트래킹 문제

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
 
 
public class Main {
    
    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
 
    
    static int L;
    static List<Character> list;
    
 
    private static boolean isVowel(char c) {
        if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u' )
            return true;
        else
            return false;
    }
    
    private static void prtPw(int idx, int pos, StringBuilder sb) throws IOException {
        if(pos==L) {
            int vowel = 0;
            int conso = 0;
            for (int i=0; i<sb.length(); i++) {
                if(isVowel(sb.charAt(i)))
                    vowel++;
                else 
                    conso++;
                
                if(vowel>=1 && conso>=2) {
                    bw.write(sb.toString()+"\n");
                    return ;
                }
            }
            return;
        }
        
        for(int i=idx; i<list.size(); i++) {
            sb.append(list.get(i));
            prtPw(i+1, pos+1, sb);
            sb.deleteCharAt(sb.length()-1);
        }
    }
    
 
    public static void main(String[] args) throws IOException{
        String[] str = br.readLine().split(" ");
        L = stoi(str[0]);
        int C = stoi(str[1]);
        
        char[] arr = br.readLine().toCharArray();
        list = new ArrayList<>();
        for(int i=0; i<C; i++
            list.add(arr[2*i]);
        Collections.sort(list);
        
        prtPw(00new StringBuilder());    
        
        bw.flush();
        bw.close();
    }
    
 
    private static int stoi(String input) {
        return Integer.parseInt(input);
    }
}
cs