히더

출처 :https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5V61LqAf8DFAWu #include #include using namespace std; int N, M, K, result, MAX_K, num;int map[20][20]; void square(int i, int j, int depth){ int starti = i; int startj = j; while (1) { if (i >= 0 && j >= 0 && i < N && j < N) { if (map[i][j]) num++; } i--;j++; if (i == starti - depth && j == startj + depth) bre..