#include <bits/stdc++.h>
#include "cave.h"
#define coutf(n, m) cout << fixed << setprecision(n) << m
#define forr(i, a, n) for (int i = a; i < n; i++)
#define forl(i, a, n) for (int i = a; i > n; i--)
#define macos ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endll "\n"
#define sp " "
typedef long long ll;
using namespace std;
void exploreCave(int n) {
int idx = 0, a[n] = {}, b[n];
for (int i = 0; i < n; i++) b[i] = i;
while ((idx = tryCombination(a)) != -1) {
a[idx] = 1;
}
answer(a, b);
}
