# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011288 | Balsa | 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 "grader.h"
void exploreCave(int n) {
int a[n], b[n];
for (int i = 0; i < n; i++) a[i] = 0;
for (int i = 0; i < n; i++) b[i] = i;
while (1) {
int ind = tryCombination(a);
if (ind == -1) {
answer(a, b);
}
a[ind] = !a[ind];
}
}