초급반 / 이지우 / 블랙잭 - 2798, N과M_6 - 15655, 제곱수찾기 - 1025

week2/dynamic_programming/돌게임/dlwldn30/Main.java

@@ -0,0 +1,20 @@
+package 돌게임.dlwldn30;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+
+        if(N%2==0){
+            System.out.println("CY");
+        }
+        else {
+            System.out.println("SK");
+        }
+    }
+}

week2/dynamic_programming/선수과목/dlwldn30/Main.java

@@ -0,0 +1,14 @@
+package 선수과목.dlwldn30;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+        int M = Integer.parseInt(br.readLine());
+    }
+}

week2/dynamic_programming/합분해/dlwldn30/Main.java

@@ -0,0 +1,28 @@
+package 합분해.dlwldn30;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+        int K = Integer.parseInt(br.readLine());
+
+        int[][] dp= new int[K+1][N+1];
+
+        for (int i = 0; i <= N; i++){
+            dp[1][i] = 1;
+        }
+
+        for (int i = 2; i <= K; i++){
+            for (int n = 0; n <= N; n++){
+                dp[i][n] = (dp[i][n-1] + dp[i-1][n]) % 1000000000;
+            }
+        }
+        System.out.println(dp[K][N]);
+    }
+
+}

week3/backtracking/N과M_6/dlwldn30/Main.java

@@ -0,0 +1,49 @@
+package N과M_6.dlwldn30;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int N, M;
+    static int[] arr;
+    static List<Integer> output = new ArrayList<>();
+    static StringBuilder sb = new StringBuilder();
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        // 입력
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        arr = new int[N];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(arr); // 사전순 출력을 위해 정렬
+
+        solve(0, 0);
+
+        System.out.print(sb);
+    }
+
+    static void solve(int start, int depth) {
+        if (depth == M) {
+            for (int num : output) {
+                sb.append(num).append(' ');
+            }
+            sb.append('\n');
+            return;
+        }
+
+        for (int i = start; i < N; i++) {
+            output.add(arr[i]);
+            solve(i + 1, depth + 1);
+            output.remove(output.size() - 1);
+        }
+    }
+}
+
+

week3/brute_force/블랙잭/dlwldn30/Main.java

@@ -0,0 +1,38 @@
+package 블랙잭.dlwldn30;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int max = 0;
+
+        int[] cards = new int[N];
+        st = new StringTokenizer(br.readLine());
+
+        for (int i = 0; i < N; i++) {
+            cards[i] = Integer.parseInt(st.nextToken());
+        }
+
+        for (int i = 0; i < N - 2; i++) {
+            for (int j = i + 1; j < N - 1; j++) {
+                for (int k = j + 1; k < N; k++) {
+                    int sum = cards[i] + cards[j] + cards[k];
+                    if (sum <= M) {
+                        max = Math.max(max, sum);
+                    }
+                }
+            }
+        }
+
+        System.out.println(max);
+    }
+}

week3/brute_force/제곱수찾기/dlwldn30/Main.java

@@ -0,0 +1,4 @@
+package 제곱수찾기.dlwldn30;
+
+public class Main {
+}

week6/topological_sorting/선수과목/dlwldn30/Main.java

@@ -0,0 +1,67 @@
+package 선수과목.dlwldn30;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int n = Integer.parseInt(st.nextToken()); // 과목 수
+        int m = Integer.parseInt(st.nextToken()); // 선수 조건 수
+
+        int[] degree = new int[n+1]; // 선수 과목들 수
+        int[] semester = new int[n+1];
+
+        List<List<Integer>> array = new ArrayList<List<Integer>>();
+        for (int i = 0; i <=n; i++) {
+            array.add(new ArrayList<>());
+        }
+
+        for (int i = 0; i <m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            array.get(a).add(b);
+            degree[b]++;
+        }
+
+        Queue<Integer> queue = new LinkedList<>();
+
+
+        //선수 과목 없는 것들
+        for (int i = 1; i<= n; i++){
+            if (degree[i] == 0){
+                queue.add(i);
+                semester[i] = 1;
+            }
+        }
+
+        while (!queue.isEmpty()){
+            int cur = queue.poll(); // 선수과목에서 처음부터 차근차근
+            for (int i : array.get(cur)){ // 얘랑 연결된 과목
+                degree[i]--;
+                if (semester[i] <= semester[cur]){
+                    semester[i] = semester[cur]+1;
+                }
+                if(degree[i] == 0){
+                    queue.add(i);
+                }
+            }
+        }
+        // 결과 출력
+        StringBuilder sb = new StringBuilder();
+        for (int i = 1; i <= n; i++) {
+            sb.append(semester[i]).append(" ");
+        }
+
+        System.out.println(sb.toString());
+
+    }
+
+
+}