# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984217 | stdfloat | 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 <bits/stdc++.h>
#include "grader.c"
using namespace std;
void exploreCave(int N) {
int a[N];
for (int i = 0; i < N; i++)
a[i] = 0;
for (int i = 0; i < N; i++)
if (tryCombination(a) == i) a[i] = 1;
int b[N];
iota(b, b + N, 0);
answer(a, b);
}