#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int n;
bool ans[105][105];
map<array<int, 4>, int> call;
int query(int x1, int y1, int x2, int y2) {
if (call.count({x1, y1, x2, y2})) {
return call[{x1, y1, x2, y2}];
}
return call[{x1, y1, x2, y2}] = countTreasure(x1, y1, x2, y2);
}
void findTreasure (int N) {
n = N;
// for(int i = 1; i <= n; i++) {
// for(int j = 1; j <= n; j++) {
// if (query(i, j, i, j)) {
// ans[i][j] = true;
// }
// }
// }
//
for(int i = 0; i < n; i++) {
int cnt = query(i+1, 1, i+1, n);
if (cnt == n) {
for(int j = 1; j <= n; j++) {
ans[i+1][j] = true;
}
continue;
}
// cout << cnt << "\n";
int curr = 1;
int l = 1, r = n;
while(curr <= cnt) {
r = n;
int rep = 0;
while(l <= r) {
int mid = (l + r) / 2;
int x = query(i+1, 1, i+1, mid);
if (x == mid) {
for(int j = 1; j <= mid; j++) {
ans[i+1][j] = true;
}
curr = mid+1;
l = mid+1;
goto Out;
}
if (x >= curr) {
rep = mid;
r = mid - 1;
} else {
l = mid + 1;
}
}
curr++;
assert(rep != 0);
// cout << "add " << i << " " << rep << "\n";
ans[i+1][rep] = true;
l = rep+1;
Out:;
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if (ans[i][j]) {
Report(i, j);
}
// cerr << ans[i][j] << " ";
}
// cerr << "\n";
}
// int cnt = countTreasure(1, 1, N, N);
// if(cnt > 0) Report(1, 1);
}
