# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104437 | Badral | 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>
using namespace std;
void exploreCave(int N) {
int a[N+1];
int d[N+1];
memset(a, 0, sizeof(a));
for(int i = 0; i < N; i++) {
d[i] = i;
if(tryCombination(a) == i+1) {
continue;
}else {
a[i] = 1;
}
}
ans(a, d);
}