백트래킹

📃 제출import java.util.Scanner;public class Main { static int[] arr = {1, 2, 3}; static int N; static int answer; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int tc = sc.nextInt(); for (int i = 0; i = N) { if (sum == N) { answer++; } return; } for (int i : arr) { ..

📃 제출import java.util.Scanner;public class Main { static int[] arr; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); arr = new int[M]; dfs(N, M, 0, 0); } public static void dfs(int N, int M, int index, int depth) { if (depth == M) { for (int i : arr) { ..

📃 제출import java.util.Scanner;public class Main { public static boolean[] visited; public static int[] arr; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); visited = new boolean[N]; arr = new int[M]; dfs(N, M, 0); } public static void dfs(int N, int M, int depth) { ..