T

@terumi26

priorityqueue pop

Java
5 months ago
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = 7;

priorityqueue push

Java
5 months ago
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt();

프랙탈노드_후위순회

Java
5 months ago
import java.util.*; import java.io.*; // n k // p_2 c_2 // ... // p_n c_n // x_1 y_1 // x_2 y_2 // ... // x_k y_k

Bitwise operation_and

Java
6 months ago
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // 1. 2진수 문자열을 정수로 변환 (2진수이므로 radix를 2로 설정) int num1 = Integer.parseInt(sc.nextLine(), 2); int

263028__C

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStream

LCA

Java
6 months ago
import java.util.*; import java.io.*; public class Main { static List<List<Integer>> graph; static int n; static int[] visited; static int[] parents; public static void bfs(int s) {

temp

Java
6 months ago
import java.util.*; import java.io.*; // n k // p_2 c_2 // ... // p_n c_n // x_1 y_1 // x_2 y_2 // ... // x_k y_k

bipartite graph(Judgement)

Java
6 months ago
import java.util.*; import java.io.*; public class Main { static List<List<Integer>> graph; static int[] visited; public static boolean bfs(int v) { Queue<Integer> q = new ArrayDeque<>(); q.add(v);

connected Components

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { static List<List<Integer>> g; static boolean[] visited; static void dfs(int v) { visited[v] = true;

Tree depth

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { static List<List<Integer>> g; static int[] depth;

dfs

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { static List<List<Integer>> g; static boolean[] visited;

Shortest Distance(maze)

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { static class Vec2{ int y; int x;

Shortest Distance

Java
6 months ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { static final int INF = -1; static int[] shortestPath(int n, List<List<Integer>> g, int s) { Queue<Integer> q