#include "treasure.h"
int map[105][105];
void check(int r, int c, int N)
{
int m = N / 2;
if (r > m && c > m) map[r][c] = countTreasure(1, 1, r, c);
if (r > m && c <= m)map[r][c] = map[r][N] - countTreasure(1, c + 1, r, N);
if (r <= m && c > m) map[r][c] = map[N][c] - countTreasure(r + 1, 1, N, c);
if (r <= m && c <= m) map[r][c] = map[r][N] + map[N][c] + countTreasure(r + 1, c + 1, N, N) - map[N][N];
}
void findTreasure(int N) {
for (int i = N; i >=1; i--) {
for (int j = N; j >=1; j--) {
check(i, j, N);
}
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (map[i][j] - map[i - 1][j] - map[i][j - 1] + map[i - 1][j - 1])Report(i, j);
}
}
}
