1600번

· 백준
코드#include #include #include using namespace std;const int mdx[] = {1, -1, 0, 0};const int mdy[] = {0, 0, 1, -1};const int hdx[] = {2, 1, -1, -2, -2, -1, 1, 2};const int hdy[] = {1, 2, 2, 1, -1, -2, -2, -1};const int INF = 987654321;int k, w, h, a[203][203], visited[203][203][32];struct Node { int x, y, dist, horseMoves;};int bfs() { queue q; q.push({0, 0, 0, k}); visited[0][0][k] = ..