히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V1SYKAaUDFAWu #include#includeusing namespace std; int D, W, K;int map[14][21];int cpy[14][21];int res; bool Check(){ bool isOk; int cnt; for (int j = 1; j > W >> K; for (int i = 1; i map[i][j]; cpy[i][j] = map[i][j]; } } res = 999; if (Check()) res = 0; else{ Solve(0, 0, 0); Solve(0, 1, 0); } cout

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define MAX_N 20 int N, result, starti, startj;int map[MAX_N][MAX_N];bool used[101];int dir[4][2] = { { 1,1 },{ 1,-1 },{ -1,-1 },{ -1,1 } }; void dfs(int i, int j, int count, int comdrc){ used[map[i][j]] = true; if (i-1 == starti && j+1 == startj) { result = max(result, count); used[map..

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do #include #include using namespace std; #define MAX_N 9 int N, K, result, max_num;int map[MAX_N][MAX_N];bool check[MAX_N][MAX_N], used;int dir[4][2] = { { 1,0 },{ -1,0 },{ 0,1 },{ 0,-1 } }; void dfs(int i, int j, int count){ for (int d = 0; d = 0 && ..