#include "bits/stdc++.h" #include "cave.h" #define MAXN 500005 int a[MAXN], n, b[MAXN]; void solve(int x) { if(x == n) { int p = tryCombination(a); if(p != -1) { answer(a, b); } return; } a[x] = 0; solve(x + 1); a[x] = 1; solve(x + 1); } void exploreCave(int N) { n = N; for(int i = 0; i < n; i++) { b[i] = i; } solve(0); }