히더

출처 : https://www.acmicpc.net/problem/14503 #include #include using namespace std; int N, M, K, result, direction, starti, startj;int map[50][50];bool visited[50][50];int dir[4][2] = { {0,-1},{1,0},{0,1},{-1,0} };bool finished; void cal(int i, int j, int d){if (finished) return; visited[i][j] = true; map[i][j] = 2; int startD; if (d == 0) startD = 0;else if (d == 1) startD = 3;else if (d == 2) st..