| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1287940 | eri16 | 동굴 (IOI13_cave) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n){
int d[n],v[n];
for (int i=0; i<n; i++){
d[i]=i;
v[i]=0;
}
int ans=0;
while (ans!=(-1)){
int c=tryCombination(v);
v[c]=1;
}
answer(v,d);
}
