#include "treasure.h"
int n,cnt;
int mat[105][105];
bool sf(int x, int y) {
return (x >= 1 && y >= 1 && x <=n && y <=n);
}
int find_(int l,int r,int x) {
if (cnt == 0)return 1;
if (r < 1 || l>n)return 0;
if (r - l + 1 <= 0)return 0;
if (r - l + 1 == countTreasure(x, l, x, r)) {
for (int i = l; i <= r; i++){
mat[x][i] = 1;
cnt--;
}
return 1;
}
if (r - l + 1 == 1) {
return 0;
}
if(find_(l, (l + r) / 2, x)) return 1;
if (cnt == 0)return 1;
if(find_((l + r) / 2 + 1, r, x)) return 1;
if (cnt == 0)return 1;
return 0;
}
void findTreasure(int N) {
n = N;
cnt = countTreasure(1, 1, n, n);
for (int i = 1; i <= N; i++) {
find_(1, n, i);
if (cnt == 0)break;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (mat[i][j] == 1)Report(i, j);
}
}
}
