diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1327] \354\206\214\355\212\270 \352\262\214\354\236\204.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1327] \354\206\214\355\212\270 \352\262\214\354\236\204.java"
new file mode 100644
index 00000000..268c02d7
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1327] \354\206\214\355\212\270 \352\262\214\354\236\204.java"	
@@ -0,0 +1,88 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	private static int n, k;
+	private static Set<String> set;
+	private static int result;
+	private static String goal;
+	
+    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.nextToken());
+        k = Integer.parseInt(st.nextToken());
+        
+        int[] number = new int[n];
+        int[] temp = new int[n];
+        st = new StringTokenizer(br.readLine());
+        for(int i=0; i<n; i++) {
+        	temp[i] = number[i] = Integer.parseInt(st.nextToken());
+        }
+        
+        Arrays.sort(temp);
+        goal = Arrays.toString(temp);
+        
+        set = new HashSet<>();
+        set.add(Arrays.toString(number));
+        
+        result = Integer.MAX_VALUE;
+        bfs(number);
+        
+        if(result == Integer.MAX_VALUE) System.out.println(-1);
+        else System.out.println(result);
+    }
+    
+    private static void bfs(int[] arr) {
+    	Queue<Node> q = new LinkedList<>();
+    	q.offer(new Node(arr, 0));
+    	set.add(Arrays.toString(arr));
+    	
+    	while(!q.isEmpty()) {
+    		Node node = q.poll();
+    		
+    		if(node.count > result) continue;
+    		if(goal.equals(node.toString())) {
+    			result = node.count;
+    			continue;
+    		}
+    		
+    		for(int i=0; i+k-1<n; i++) {
+    			node.swap(i, i+k-1);
+    			if(set.contains(node.toString())) {
+    				node.swap(i, i+k-1);
+    				continue;
+    			}
+    			q.offer(new Node(node.arr, node.count+1));
+    			set.add(node.toString());
+    			node.swap(i, i+k-1);
+    		}
+    	}
+    }
+	
+	private static class Node{
+		int[] arr;
+		int count;
+		
+		public Node(int[] arr, int count) {
+			this.arr = Arrays.copyOf(arr, arr.length);
+			this.count = count;
+		}
+		
+		public void swap(int left, int right) {
+			while(left < right) {
+				int temp = arr[left];
+				arr[left] = arr[right];
+				arr[right] = temp;
+				left++;
+				right--;
+			}
+		}
+		
+		@Override
+		public String toString() {
+			return Arrays.toString(arr);
+		}
+	}
+}
diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1405] \353\257\270\354\271\234 \353\241\234\353\264\207.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1405] \353\257\270\354\271\234 \353\241\234\353\264\207.java"
new file mode 100644
index 00000000..029c7779
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-1405] \353\257\270\354\271\234 \353\241\234\353\264\207.java"	
@@ -0,0 +1,53 @@
+import java.io.*;
+import java.util.*;
+import java.math.BigDecimal;
+
+public class Main {
+	private static boolean[][] visited;
+	private static int n;
+	private static double[] percent;
+	private static int[][] d = {{0,1},{0,-1},{1,0},{-1,0}};
+	private static double total;
+	
+    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.nextToken());
+        percent = new double[4];
+        for(int i=0; i<4; i++) {
+        	percent[i] = Integer.parseInt(st.nextToken()) / 100.0;
+        }
+        
+        if(n == 1) {
+        	System.out.println(1.0);
+        	return;
+        }
+        
+        visited = new boolean[2*n+1][2*n+1];
+        visited[n][n] = true;
+        dfs(1, n, n, 0, "");
+        
+        BigDecimal bd = new BigDecimal(Double.toString(total));
+        System.out.println(bd.toPlainString());
+    }
+    private static String[] p = {"E","W","S","N"};
+    private static void dfs(double current, int x, int y, int dept, String path) {
+    	if(dept == n) {
+    		total += current;
+    		return;
+    	}
+    	
+    	for(int i=0; i<d.length; i++) {
+    		if(percent[i] == 0) continue;
+    		int nx = x+d[i][0];
+    		int ny = y+d[i][1];
+    		if(visited[nx][ny]) continue;
+    		visited[nx][ny] = true;
+    		dfs(current * percent[i], nx, ny, dept+1, path+p[i]);
+    		visited[nx][ny] = false;
+    	}
+    	
+    }
+}
diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-21278] \355\230\270\354\204\235\354\235\264 \353\221\220 \353\247\210\353\246\254 \354\271\230\355\202\250.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-21278] \355\230\270\354\204\235\354\235\264 \353\221\220 \353\247\210\353\246\254 \354\271\230\355\202\250.java"
new file mode 100644
index 00000000..69155b3d
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-21278] \355\230\270\354\204\235\354\235\264 \353\221\220 \353\247\210\353\246\254 \354\271\230\355\202\250.java"	
@@ -0,0 +1,67 @@
+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 m = Integer.parseInt(st.nextToken());
+        
+        //1. dist 배열 준비
+        //1-1. dist 배열 최댓값으로 초기화
+        int[][] dist = new int[n][n];
+        for(int i=0; i<n; i++) {
+        	Arrays.fill(dist[i], (int) 1e9);
+        }
+        
+        //1-2. 자기 자신 거리는 0으로 설정
+        for(int i=0; i<n; i++) {
+        	for(int j=0; j<n; j++) {
+        		if(i==j) dist[i][j] = 0;
+        	}
+        }
+        
+        //1-3. 연결된 노드는 거리 값으로 설정
+        for(int i=0; i<m; i++) {
+        	st = new StringTokenizer(br.readLine());
+        	int a = Integer.parseInt(st.nextToken())-1;
+        	int b = Integer.parseInt(st.nextToken())-1;
+        	
+        	dist[a][b] = 1;
+        	dist[b][a] = 1;
+        }
+        
+        //2. 플로이드-워셜 알고리즘으로 모든 노드별 모든 노드까지 최단 거리로 설정
+        for(int k=0; k<n; k++) {
+        	for(int i=0; i<n; i++) {
+        		for(int j=0; j<n; j++) {
+        			dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
+        		}
+        	}
+        }
+        
+        //3. 정답 찾기
+        int min = Integer.MAX_VALUE;// 최단 거리 합
+        int a = 0;// 치킨 집 1호점
+        int b = 0;// 치킨 집 2호점
+        
+        for(int i=0; i<n; i++) {// 1호점 위치
+        	for(int j=0; j<n; j++) {// 2호점 위치
+        		int sum = 0;
+        		for(int h=0; h<n; h++) {// 모든 집에서 가장 가까운 치킨 집까지의 접근성 계산
+        			sum += Math.min(dist[h][i], dist[h][j]) * 2;
+        		}
+        		if(sum < min) {// 더 작다면 값 수정
+        			min = sum;
+        			a = i+1;
+        			b = j+1;
+        		}
+        	}
+        }
+        
+        System.out.println(a + " " + b + " " + min);
+    }
+}
diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-2629] \354\226\221\355\214\224\354\240\200\354\232\270.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-2629] \354\226\221\355\214\224\354\240\200\354\232\270.java"
new file mode 100644
index 00000000..c7730f63
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-2629] \354\226\221\355\214\224\354\240\200\354\232\270.java"	
@@ -0,0 +1,45 @@
+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[] chu = new int[n+1];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int total = 0;
+        for(int i=1; i<=n; i++) {
+        	chu[i] = Integer.parseInt(st.nextToken());
+        	total += chu[i];
+        }
+        
+        int[][] dp = new int[n+1][total+1];
+        //1번 추 추가
+        dp[1][chu[1]] = 1;
+        
+        //2번 추부터 ~ n번까지 추가
+        for(int i=2; i<=n; i++) {
+        	for(int j=0; j<=total; j++) {
+        		if(dp[i-1][j] == 0) continue;
+        		dp[i][j] = dp[i-1][j];
+        		dp[i][j+chu[i]]++;
+        		dp[i][Math.abs(j-chu[i])]++;
+        	}
+        	dp[i][chu[i]]++;
+        }
+        
+        
+        int m = Integer.parseInt(br.readLine());
+        st = new StringTokenizer(br.readLine());
+        StringBuilder sb = new StringBuilder();
+        for(int i=0; i<m; i++) {
+        	int a = Integer.parseInt(st.nextToken());
+        	if(a <= total && dp[n][a] > 0) sb.append("Y ");
+        	else sb.append("N ");
+        }
+        
+        System.out.println(sb.toString().trim());
+    }
+}
diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-3079] \354\236\205\352\265\255\354\213\254\354\202\254.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-3079] \354\236\205\352\265\255\354\213\254\354\202\254.java"
new file mode 100644
index 00000000..76e6cb91
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-3079] \354\236\205\352\265\255\354\213\254\354\202\254.java"	
@@ -0,0 +1,50 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	private static long[] process;
+	private static long result;
+	private static long m;
+	
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        long n = Long.parseLong(st.nextToken());
+        m = Long.parseLong(st.nextToken());
+        
+        process = new long[(int) n];
+        long max = 0;
+        for(int i=0; i<n; i++) {
+        	process[i] = Long.parseLong(br.readLine());
+        	max = Math.max(max, process[i]);
+        }
+        result = Long.MAX_VALUE;
+        
+        long left = 0;
+        long right = max*m;
+        while(left <= right) {
+        	long mid = left + (right-left)/2;
+        	
+        	long count = counting(mid);
+        	if(count >= m) {
+        		result = Math.min(result, mid);
+        		right = mid-1;
+        		continue;
+        	}
+        	left = mid+1;
+        }
+        
+        System.out.println(result);
+    }
+
+	private static long counting(long mid) {
+		long count = 0;
+		for(int i=0; i<process.length; i++) {
+			if(count > m) break;
+			count += mid/process[i];
+		}
+		
+		return count;
+	}
+}
diff --git "a/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-7682] \355\213\261\355\203\235\355\206\240.java" "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-7682] \355\213\261\355\203\235\355\206\240.java"
new file mode 100644
index 00000000..1b7df53b
--- /dev/null
+++ "b/\354\234\240\353\263\221\352\267\234_12\354\243\274\354\260\250/[BOJ-7682] \355\213\261\355\203\235\355\206\240.java"	
@@ -0,0 +1,146 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+	private static final String VALID = "valid";
+	private static final String INVALID = "invalid";
+	private static char[][] map;
+	private static List<int[]> xs = new ArrayList<>();
+	private static List<int[]> os = new ArrayList<>();
+	private static boolean[] xvisited;
+	private static boolean[] ovisited;
+	private static char[][] testMap;
+	private static int[][] d = {{0,1},{1,1},{1,0},{1,-1},{0,-1}};
+	
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        
+        StringBuilder sb = new StringBuilder();
+        while(true) {
+        	String input = br.readLine();
+        	if(input.equals("end")) {
+        		System.out.println(sb.toString().trim());
+        		return;
+        	}
+        	
+        	map = new char[3][3];
+        	xs.clear();
+        	os.clear();
+        	for(int i=0; i<3; i++) {
+        		for(int j=0; j<3; j++) {
+        			map[i][j] = input.charAt(i*3 + j);
+        			if(map[i][j] == 'X') xs.add(new int[] {i,j});
+        			else if(map[i][j] == 'O') os.add(new int[] {i,j});
+        		}
+        	}
+        	
+        	//case 1: O의 개수가 X보다 많은 경우 불가능
+        	//case 2: X의 개수가 O보다 2개 이상 많은 경우 불가능
+        	if(xs.size() < os.size() || xs.size()-os.size() > 1) {
+        		sb.append(INVALID).append("\n");
+        		continue;
+        	}
+        	//case 3: 꽉 안 찼는데 안 끝난 경우 불가능
+        	if(xs.size()+os.size() < 9 && !done(map, xs.size())) {
+        		sb.append(INVALID).append("\n");
+    			continue;
+        	}
+        	
+        	//case 4: 꽉 찼는데 안 끝난 경우 가능
+        	if(!done(map, xs.size())) {
+        		sb.append(VALID).append("\n");
+        		continue;
+        	}
+        	
+        	//case 5: 꽉 안 찼는데 끝난 경우 직접 시뮬
+        	//case 6: 꽉 찼는데 끝난 경우 직접 시뮬
+        	xvisited = new boolean[xs.size()];
+        	ovisited = new boolean[os.size()];
+        	testMap = new char[3][3];
+        	boolean isDone = false;
+        	for(int i=0; i<xs.size(); i++) {
+        		xvisited[i] = true;
+        		testMap[xs.get(i)[0]][xs.get(i)[1]] = 'X';
+        		if(dfs(i, false, 1, 0)) {
+        			sb.append(VALID).append("\n");
+        			isDone = true;
+        			break;
+        		}
+        		xvisited[i] = false;
+        		testMap[xs.get(i)[0]][xs.get(i)[1]] = '.';
+        	}
+
+        	if(!isDone) sb.append(INVALID).append("\n");
+        }
+        
+    }
+    
+    /**
+     * @param x true면 x차례 false면 o차례
+     * */
+    private static boolean dfs(int current, boolean isX, int xCount, int oCount) {
+    	if(done(testMap, xCount)) {
+    		if(xCount != xs.size() || oCount != os.size()) return false;
+    		return true;
+    	}
+    	
+    	if(isX) {
+    		for(int i=0; i<xs.size(); i++) {
+    			if(xvisited[i]) continue;
+    			xvisited[i] = true;
+        		testMap[xs.get(i)[0]][xs.get(i)[1]] = 'X';
+        		if(dfs(i, false, xCount+1, oCount)) return true;
+        		xvisited[i] = false;
+        		testMap[xs.get(i)[0]][xs.get(i)[1]] = '.';
+    		}
+    	}
+    	else {
+    		for(int i=0; i<os.size(); i++) {
+    			if(ovisited[i]) continue;
+    			ovisited[i] = true;
+        		testMap[os.get(i)[0]][os.get(i)[1]] = 'O';
+        		if(dfs(i, true, xCount, oCount+1)) return true;
+        		ovisited[i] = false;
+        		testMap[os.get(i)[0]][os.get(i)[1]] = '.';
+    		}
+    	}
+    	
+    	return xCount==xs.size() && oCount==os.size();
+    }
+    
+	private static boolean done(char[][] map, int xCount) {
+		if(xCount < 3) return false;
+		
+		for(int i=0; i<3; i++) {
+			for(int j=0; j<3; j++) {
+				if(map[i][j] == 'X') {
+					if(find(map, 'X', i, j)) return true;
+				}
+				if(map[i][j] == 'O') {
+					if(find(map, 'O', i, j)) return true;
+				}
+			}
+		}
+		
+		return false;
+	}
+
+	
+	private static boolean find(char[][] map, char target, int x, int y) {
+		for(int i=0; i<d.length; i++) {
+			int count = 1;
+			int nx = x + d[i][0];
+			int ny = y + d[i][1];
+			
+			while(nx>=0 && nx<3 && ny>=0 && ny<3) {
+				if(map[nx][ny] == target) count++;
+				nx = nx + d[i][0];
+				ny = ny + d[i][1];
+			}
+			
+			if(count == 3) return true;
+		}
+		
+		return false;
+	}
+}