백준_11505 구간 곱 구하기 (세그먼트 트리)
Algorithm/Algorithm 문제2024. 3. 17. 17:17백준_11505 구간 곱 구하기 (세그먼트 트리)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; /** * (a * b) % c == ((a % c) * (b % c)) % c */ public class BJ_11505_구간구하기 { static long[] tree; static int leafSize; static StringBuilder result = new StringBuilder(); static final long modNum = 1000000007; public static void main(String[] args) throws IOException { Bu..

백준_10868 최솟값 (세그먼트 트리)
Algorithm/Algorithm 문제2024. 3. 16. 17:27백준_10868 최솟값 (세그먼트 트리)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_10868_최솟값 { static long[] tree; static int leafSize; static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer s..

백준_2042 구간 합 구하기 (세그먼트 트리)
Algorithm/Algorithm 문제2024. 3. 16. 17:26백준_2042 구간 합 구하기 (세그먼트 트리)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_2042_구간합구하기 { static int leafSize; //리프 개수 static long[] tree; static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringT..

백준_1991 트리 순회 (이진트리, 순회)
Algorithm/Algorithm 문제2024. 3. 8. 11:15백준_1991 트리 순회 (이진트리, 순회)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_1991_트리순회 { static Node[] tree; static StringBuilder preOrderResult = new StringBuilder(); static StringBuilder inOrderResult = new StringBuilder(); static StringBuilder postOrderResult = new StringBuilder(); public static void main(String[] args) throws ..

백준_14425 문자열 집합 (트라이)
Algorithm/Algorithm 문제2024. 3. 7. 16:10백준_14425 문자열 집합 (트라이)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class BJ_14425_문자열집합 { 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..

대외활동/SELAB2024. 3. 7. 12:08SELAB - 논문 요약

논문 요약본 본 논문 : https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE11481309

대외활동/SELAB2024. 3. 7. 12:07SELAB - 논문 요약

논문 요약본 본 논문 : https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE11481322

대외활동/SELAB2024. 3. 7. 12:04SELAB - 논문 요약

논문 요약본 본 논문 : https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE11438585

백준_1068 트리 (트리, dfs)
Algorithm/Algorithm 문제2024. 3. 6. 11:57백준_1068 트리 (트리, dfs)

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.StringTokenizer; public class BJ_1068_트리 { static int rootNode, deleteNode, result; static boolean[] visited; static ArrayList[] tree; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(Syst..

image