# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166683 | sams | 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 S[N];
int D[N];
memset(S, 0, sizeof S);
memset(D, 0, sizeof D);
for(int i = 0 ; i < N ; ++i)
{
S[i] = 1;
int s = tryCombination(S);
D[s] = i;
S[i] = 0;
}
answer(S, D);
}