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 a[n] = {0}, ans[n], d[n];
int q = 0;
int j = 0;
while(q != -1)
{
int q = tryCombination(a);
for(; j<q; j++)
{
ans[j] = a[j];
d[j] = j;
}
a[j] ^= a[j];
}
answer(ans, d);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |