#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int ask(int r1, int c1, int r2, int c2)
{
if (r1 > r2 || c1 > c2)
{
return 0;
}
return countTreasure(r1, c1, r2, c2);
}
const int N = 100 + 7;
int ul[N][N];
int ur[N][N];
int dl[N][N];
int dr[N][N];
void findTreasure(int n)
{
int total = ask(1, 1, n, n);
int half = (n + 1) / 2;
for (int i = 1; i <= n; i++)
{
if (i <= half + 1)
{
for (int j = 1; j <= n; j++)
{
dl[i][j] = ask(i, 1, n, j);
}
}
for (int j = 1; j <= n; j++)
{
if (j <= half)
{
ur[i][j] = ask(1, j, i, n);
}
if (half - 1 <= j)
{
if (half - 1 <= i)
{
ul[i][j] = ask(1, 1, i, j);
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= half - 1; j++)
{
ul[i][j] = ul[i][n] - ur[i][j + 1];
}
}
for (int i = 1; i <= half; i++)
{
for (int j = 1; j <= n; j++)
{
ul[i][j] = ul[n][j] - dl[i + 1][j];
/// assert(ask(1, 1, i, j) + ask(i + 1, 1, n, j) == ask(1, 1, n, j));
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
int val_ij = ul[i][j] - ul[i - 1][j] - ul[i][j - 1] + ul[i - 1][j - 1];
if (val_ij)
{
Report(i, j);
}
}
}
}
