📌BOJ 알고리즘 트레이닝
BFS-1600번 말이 되고픈 원숭이
#include #include using namespace std; const int INF = 987654321; const int MAX_N = 200; const int MAX_K = 30; int visited[MAX_K + 1][MAX_N + 1][MAX_N + 1] = { 0, }; int board[MAX_N + 1][MAX_N + 1]; int N, M; int jumpY[8] = { -2,-2,-1,-1,1,1,2,2 }; int jumpX[8] = { -1,1,-2,2,-2,2,-1,1 }; int goY[4] = { 1,-1,0,0 }; int goX[4] = { 0,0,1,-1 }; bool can_go(int y, int x) { if (y N || xM) ret..
