# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623862 | hfoliacots | Art Collections (BOI22_art) | 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 "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n) {
vector<int> order(n);
for (int i = 0; i < n; i++) order[i] = i+1;
do {
int c = publish(order);
if (c == 0) {
answer(order);
break;
}
}while (next_permutation(order.begin(), order.end()))
}