# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696979 | Elvin_Fritl | Cave (IOI13_cave) | C++17 | 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 "cave.h"
void exploreCave(int n) {
vector<int>v(n,0);
vector<int>res(n);
int k=tryCombination(v);
if(k==-1){
for(int i=0;i<n;i++){
v[i]=1;
int toto=tryCombination(v);
res[i]=toto;
}
}
answer(v,res);
}