# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998495 | ezzzay | 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 "cave.h"
void exploreCave(int N) {
int col[N], con[N];
for(int i=0;i<N;i++){
con[i]=i;
col[i]=0;
}
for(int i=0;i<N;i++){
if(tryombination(col)==i)col[i]=1;
}
answer(col,con);
}