# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382315 | Andyvanh1 | Cave (IOI13_cave) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
void exploreCave(int n){
int S[n];
int D[n];
for(int i = 0; i < n; i++){
S[i] = 0;
D[i] = i+1;
}
int k = 0;
while(k<n){
k = tryCombination(S);
S[k] = 1-S[k];
}
answer(S,D);
}
int main() {
return 0;
}