코딩테스트 (133) 썸네일형 리스트형 백준 13549 : 숨바꼭질 3 [JAVA] [문제 링크]https://www.acmicpc.net/problem/13549[난이도]-Gold 5 [알고리즘]- BFS [코드]import java.io.*;import java.util.*;public class Main { static int max = 100000; 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(s.. 백준 2589 : 보물섬 [JAVA] [문제 링크]https://www.acmicpc.net/problem/2589[난이도]- Gold 5 [알고리즘]- BFS [코드]import java.io.*;import java.util.*;public class Main { static int L, W; static char[][] graph; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); .. 백준 1389 : 케빈 베이컨의 6단계 법칙 [JAVA] [문제 링크]https://www.acmicpc.net/problem/1389[난이도]- Silver 1 [알고리즘]- BFS [코드]import java.io.*;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.. 백준 18352 : 특정 거리의 도시 찾기 [JAVA] [문제 링크]https://www.acmicpc.net/problem/18352[난이도]- Silver 2 [알고리즘]- BFS [코드]import java.io.*;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()); in.. 백준 11725 : 트리의 부모 찾기 [JAVA] [문제 링크]https://www.acmicpc.net/problem/11725[난이도]- Silver 2 [알고리즘]- BFS [코드]import java.io.*;import java.util.*;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()); List> tree = new ArrayList(); // 트리 선언 for (int i = 0; i ()).. 백준 1932 : 정수 삼각형 [JAVA] [문제 링크]https://www.acmicpc.net/problem/1932[난이도]- Silver 1 [알고리즘]- DP [코드]import java.io.*;import java.util.*;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[][] triangle = new int[n][]; // 2차원은 가변적으로 선언 int[][] dp .. 백준 11055 : 가장 큰 증가하는 부분 수열2 [JAVA] [문제 링크]https://www.acmicpc.net/problem/11055[난이도]- Silver 2 [알고리즘]- DP [코드]import java.io.*;import java.util.*;public class Main { static int[][][] dp = new int[51][51][51]; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.o.. 백준 9184 : 신나는 함수 실행[JAVA] [문제 링크]https://www.acmicpc.net/problem/9184[난이도]- Silver 2 [알고리즘]- DP [코드]import java.io.*;import java.util.*;public class Main { static int[][][] dp = new int[51][51][51]; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.ou.. 이전 1 2 3 4 5 ··· 17 다음
