#include "treasure.h"
int tCnt[102][102];
void findTreasure (int N) {
int mid = N / 2;
for (int i = N; i >= 1; i--) {
for (int j = N; j >= 1; j--) {
if (i <= mid) {
if (j <= mid) // 1 사분면
tCnt[i][j] = tCnt[i][N] + tCnt[N][j] + countTreasure(i + 1, j + 1, N, N) - tCnt[N][N];
else // 2 사분면
tCnt[i][j] = tCnt[N][j] - countTreasure(i + 1, 1, N, j);
}
else {
if (j <= mid) // 3 사분면
tCnt[i][j] = tCnt[i][N] - countTreasure(1, j + 1, i, N);
else // 4 사분면
tCnt[i][j] = countTreasure(1, 1, i, j);
}
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (tCnt[i][j] + tCnt[i - 1][j - 1] - (tCnt[i][j - 1] + tCnt[i - 1][j]))
Report(i, j);
}
}
}
