Developer MJ

N X N 체스판에 N개의 Queen들이 같은 열과 대각선에 위치하지 않도록 하는 좌표 출력 import java.io.IOException; import java.util.Arrays; import java.util.Scanner; public class Nqueens { private static int[] cols; private static int n; private static int level; public static void main(String[] args) { // TODO Auto-generated method stub // BufferedReader br = new BufferedReader(new // InputStreamReader(System.in)); Scanner s = n..

미로찾기 문제 import java.io.BufferedReader; import java.io.File; import java.io.FileInputStream; import java.io.IOException; import java.io.InputStreamReader; public class Maze { private static final String PATH = "0"; private static final String WALL = "1"; private static final String BLOCKED = "9"; private static final String ROUTE = "7"; public static void main(String[] args) { // TODO Auto-genera..

주어진 집합의 모든 부분집합 = 멱집합 public class PowerSet { private static String[] S = { "a", "b", "c", "d", "e", "f" }; private static int n = S.length; private static boolean[] include = new boolean[n]; private static int level; public static void main(String[] args) { // TODO Auto-generated method stub level = 0; powerset(level); } public static void powerset(int level) { if (level == n) { for (int i = 0;..