[백준/C++] 1600 말이 되고픈 원숭이
https://www.acmicpc.net/problem/1600 코드#include #include #include using namespace std; #define MAX 201 #define FASTIO ios::sync_with_stdio(false); cin.tie(NULL); typedef pair pi; int arr[MAX][MAX], w, h, k, ans = INT_MAX; int dx[4] = { 1, -1, 0, 0 }, dy[4] = { 0, 0, 1, -1 }; int ddx[8] = { -2, -1, -2, -1, 1, 2, 1, 2 }; int ddy[8] = { 1, 2, -1, -2, 2, 1, -2, -1 }; bool visit[MAX][MAX][31]; void b..
