#include <bits/stdc++.h> #include "cave.h" using namespace std; void exploreCave(int N) { int S[N], D[N]; for(int i = 0; i < N; ++i) D[i] = i, S[i] = 0; for(int i = 0; i < N; ++i){ int ans = tryCombination(S); if(ans <= i) S[i] ^= 1; } answer(S, D); }