# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917040 | manishjha91 | 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"
#include <bits/stdc++.h>
void exploreCave(int N) {
int a[N];
memset(a,0,sizeof a);
int d[N];
for(int i=0; i<N; i++) d[i] = i;
int i=tryComnination(a);
while(i!=-1)
{
a[i] ^=1;
i = tryCombination(a);
}
answer(a,d);
}