우주수첩의 우주먼지

https://www.acmicpc.net/problem/1182  package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_1182 { static int N,S; static int[] arr= new int[30]; static int count=0; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReade..

https://www.acmicpc.net/problem/15655  package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.Arrays;import java.util.StringTokenizer;public class BOJ_15655 { static int N; static int M; static int[] arr; static boolean[] visited; static int[] input; static void dfs(int depth, int at){ if(d..

https://www.acmicpc.net/problem/15654  package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.Arrays;import java.util.StringTokenizer;public class BOJ_15654 { static int N; static int M; static int[] arr; static boolean[] visited; static int[] input; static void dfs(int depth){ if(depth==M)..

https://www.acmicpc.net/problem/15652  package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_15652 { static int N; static int M; static int[] arr; static void dfs(int depth,int at){ if(depth==M){ for(int val : arr){ System.out.print(val+..

시간 초과package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_15651 { static int N; static int M; static int[] arr; static void dfs(int depth){ if(depth==M){ for(int val : arr){ System.out.print(val + " "); } System.ou..

https://www.acmicpc.net/problem/15650package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_15650 { static int N; static int M; static int[] arr; static void dfs(int at, int depth){ if(depth == M){ for(int val : arr){ System.out.print(val..

https://www.acmicpc.net/problem/15649 package BKD_0x0C_BackTracking;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ_15649 { // 1부터 N까지의 자연수 중에서 중복 없이 M개를 고르는 수열 static int N; static int M; static boolean[] visit = new boolean[N]; // 재귀를 진행하면서 이미 방문한 노드라면 다음 노드를 탐색하도록 하기 위함. == 유만한 노드인지 검사 ..