현재 차례의 최고의 답을 찾는 문제다른 금액의 동전이 여러 개 주어졌을 때 M원을 만드는 최소의 개수 https://www.acmicpc.net/problem/11047import java.io.*;import java.util.*;public class Main { static int N, K; static int[] arr; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(), " "); ..

https://www.acmicpc.net/problem/2559 import java.io.*;import java.util.*;public class Main { static int N, K; static int[] numArr; static int max; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(), " "); N = Integer.parseInt(st.nextTok..

- 시뮬레이션특정 조건 만족할 때 까지 실행 while(true)조건을 만나면 break https://www.acmicpc.net/problem/14503import java.io.*;import java.util.*;public class Main { static int N, M, r, c, d; static int[][] map; static int cnt = 0; static int[] dy = {-1, 0, 1, 0}; //북 동 남 서 static int[] dx = {0, 1, 0, -1}; static int[] leftD = {3, 0, 1, 2}; public static void main(String[] args) throws IOE..

https://www.acmicpc.net/problem/15652 import java.io.*;import java.util.*;public class Main { static int n, m; static int[] arr; static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLi..

https://www.acmicpc.net/problem/15651 import java.io.*;import java.util.*;public class Main { static int n, m; static int[] arr; // 출력할 수열을 담을 배열(길이가 m인 수열) static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new..

https://www.acmicpc.net/problem/15650 import java.io.*;import java.util.*;public class Main { static int n, m; static int[] arr; // 출력할 수열을 담을 배열(길이가 m인 수열) static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new..

https://www.acmicpc.net/problem/15649 import java.io.*;import java.util.*;public class Main { static int n, m; static int[] arr; // 출력할 수열을 담을 배열(길이가 m인 수열) static boolean[] chk; // 재귀함수에서 1~n까지 자연수의 방문 여부를 확인 할 배열 static StringBuilder result = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new..

https://www.acmicpc.net/problem/1926 DFS 풀이import java.io.*;import java.util.*;public class Main { static int n, m; static int[][] map; static boolean[][] visited; static ArrayList result; static int each = 0; static int[] dy = {-1, 1, 0, 0}; static int[] dx = {0, 0, -1, 1}; public static void main(String[] args) throws IOException { BufferedReader br =..

https://www.acmicpc.net/problem/2178 import java.io.*;import java.util.*;public class Main { static int n, m; static int[][] map; static int[][] dist; static int[] dy = {-1, 1, 0, 0}; static int[] dx = {0, 0, -1, 1}; static class Pos { int y, x; public Pos(int y, int x) { this.y = y; this.x = x; } } public static void main(String..

https://www.acmicpc.net/problem/2667 import java.io.*;import java.util.*;public class Main { static int n; static int[][] map; static boolean[][] visited; static int count = 0; static ArrayList resultArr; static int[] dy = {-1, 1, 0, 0}; static int[] dx = {0, 0, -1, 1}; static class Pos { int y, x; public Pos(int y, int x) { this.y = y; ..