# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670620 | pzorro | 동굴 (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 <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5 * 1e3;
int s[MAXN];
int d[MAXN];
int tryCombination(int S[]);
void answer(int S[],int D[]);
void exploreCave(int n){
//case 1 -> si <-> di
int res;
do{
res = tryCombination(s);
if(res != -1){
s[res]+=1;
}
}while(res != -1)
answer(s, d);
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++){
s[i] = 0;
d[i] = i;
}
exploreCave(n);
return 0;
}