feat(Taewoo): add/Baekjoon-2023, Baekjoon-13023, Baekjoon-11724

Author: kohtaewoo

Taewoo/Sep/Baekjoon-11724-연결 요소의 개수.java

@@ -0,0 +1,51 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringTokenizer st;
+    static boolean[] visited;
+    static ArrayList<Integer>[] graph;
+
+    public static void main(String[] args) throws IOException {
+        st = new StringTokenizer(br.readLine());
+        int n = Integer.parseInt(st.nextToken());
+        int m = Integer.parseInt(st.nextToken());
+
+        graph = new ArrayList[n+1];
+        visited = new boolean[n+1];
+        for (int i = 1; i <= n; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 1; i <= m; i++) {
+            st = new StringTokenizer(br.readLine());
+            int u = Integer.parseInt(st.nextToken());
+            int v = Integer.parseInt(st.nextToken());
+
+            graph[u].add(v);
+            graph[v].add(u);
+        }
+
+        int count = 0;
+        for (int i = 1; i <= n; i++) {
+            if (!visited[i]) {
+                count++;
+                dfs(i);
+            }
+        }
+        bw.write(String.valueOf(count));
+        bw.close();
+    }
+
+    public static void dfs(int node) {
+        visited[node] = true;
+
+        for (int neighbor : graph[node]) {
+            if (!visited[neighbor]) {
+                dfs(neighbor);
+            }
+        }
+    }
+}

Taewoo/Sep/Baekjoon-13023-ABCDE.java

@@ -0,0 +1,62 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+	static boolean[] visited;
+	static ArrayList<Integer>[] graph;
+	static boolean is_true = false;
+
+	public static void main(String[] args) throws IOException {
+		st = new StringTokenizer(br.readLine());
+		int n = Integer.parseInt(st.nextToken());
+		int m = Integer.parseInt(st.nextToken());
+
+		graph = new ArrayList[n];
+		visited = new boolean[n];
+		for (int i = 0; i < n; i++) {
+			graph[i] = new ArrayList<>();
+		}
+
+		for (int i = 0; i < m; i++) {
+			st = new StringTokenizer(br.readLine());
+			int u = Integer.parseInt(st.nextToken());
+			int v = Integer.parseInt(st.nextToken());
+
+			graph[u].add(v);
+			graph[v].add(u);
+		}
+
+		int count = 0;
+		for (int i = 0; i < n; i++) {
+			dfs(i, count);
+			count = 0;
+		}
+
+		if (is_true) {
+			bw.write("1");
+			bw.close();
+		} else {
+			bw.write("0");
+			bw.close();
+		}
+
+	}
+
+	public static void dfs(int node, int count) {
+		visited[node] = true;
+		if (count == 4) {
+			is_true = true;
+			return;
+		}
+
+		for (int neighbor : graph[node]) {
+			if (!visited[neighbor]) {
+				dfs(neighbor, count + 1);
+			}
+		}
+		visited[node] = false;
+	}
+}

Taewoo/Sep/Baekjoon-2023-신기한 소수.java

@@ -0,0 +1,53 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st;
+	static int n;
+	static ArrayList<Integer> result_list;
+
+	public static void main(String[] args) throws IOException {
+		st = new StringTokenizer(br.readLine());
+		n = Integer.parseInt(st.nextToken());
+
+		int count = 1;
+		result_list = new ArrayList<>();
+		dfs(2, 1);
+		dfs(3, 1);
+		dfs(5, 1);
+		dfs(7, 1);
+
+		while (!result_list.isEmpty()) {
+			bw.write(String.valueOf(result_list.remove(0)) + "\n");
+		}
+		bw.close();
+	}
+
+	public static void dfs(int num, int count) {
+		if (!is_prime(num)) {
+			return;
+		}
+
+		if (count == n) {
+			result_list.add(num);
+			return;
+		}
+
+		for (int i = 0; i < 10; i++) {
+			int nextNum = 10 * num + i;
+			dfs(nextNum, count + 1);
+		}
+		count = 1;
+	}
+
+	public static boolean is_prime(int num) {
+		for (int i = 2; i * i <= num; i++) {
+			if (num % i == 0) {
+				return false;
+			}
+		}
+		return true;
+	}
+}