전체 글 (225) 썸네일형 리스트형 백준 15650: N과 M (2) [JAVA] https://www.acmicpc.net/problem/15650 [난이도]- Silver 3 [알고리즘]- 백트래킹 [코드]import java.io.*;import java.util.*;public class Main { static int N, M; static boolean[] checked; static int[] arr; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputSt.. 백준 15649: N과 M (1)[JAVA] https://www.acmicpc.net/problem/15649[난이도]- Silver 3 [알고리즘]- 백트래킹 [코드]import java.io.*;import java.util.*;public class Main { static int N, M; static int[] arr; static boolean[] checked; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLin.. 백준 10974: 모든 순열[JAVA] https://www.acmicpc.net/problem/10974[난이도]- Silver 3 [알고리즘]- 백트래킹 [코드]import java.io.*;import java.util.*;public class Main { static int N; static boolean[] checked; static int[] arr; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamW.. 백준 2992: 크면서 작은 수[JAVA] https://www.acmicpc.net/problem/2992 [난이도]- Silver 3 [알고리즘]- 백트래킹 [코드]import java.io.*;import java.util.*;public class Main { static int N, num, min = Integer.MAX_VALUE; static int[] arr, list; static boolean[] visited; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = .. 백준 11060: 점프 점프[JAVA] https://www.acmicpc.net/problem/11123 [난이도]- Silver 2 [알고리즘]- BFS [코드]import java.io.*;import java.util.*;public class Main { static char[][] graph; static boolean[][] visited; static int T, H, W, answer = 0; static Queue queue; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {-0, 0, -1, 1}; static ArrayList list; public static void main(String[] args) throws Exception.. 백준 11060: 점프 점프[JAVA] https://www.acmicpc.net/problem/11060 [난이도]- Silver 2 [알고리즘]- bfs [코드]import java.io.*;import java.util.*;public class Main { static int N; static int[] maze; static boolean[] visited; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStream.. 백준 2644: 촌수계산[JAVA] https://www.acmicpc.net/problem/2644 [난이도]- Silver 2 [알고리즘]- bfs [코드]import java.io.*;import java.util.*;public class Main { static ArrayList> graph = new ArrayList(); static int[] dist; static boolean[] visited; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new Buf.. 백준 1012: 유기농 배추[JAVA] https://www.acmicpc.net/problem/1012 1012번: 유기농 배추차세대 영농인 한나는 강원도 고랭지에서 유기농 배추를 재배하기로 하였다. 농약을 쓰지 않고 배추를 재배하려면 배추를 해충으로부터 보호하는 것이 중요하기 때문에, 한나는 해충 방지에 www.acmicpc.net [난이도]- Silver 3 [알고리즘]- bfs [코드]import java.io.*;import java.util.*;public class Main { static boolean[][] visited; static int[][] graph; static int N, M, answer = 0; static int[] dx = {-1, 1, 0, 0}; // 상, 하, 좌, 우 s.. 이전 1 2 3 4 5 6 ··· 29 다음
