# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721551 | kas_s | 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 <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void solve() {
int n; cin >> n;
vector<int> a;
for (int i = 1; i <= n; i++) a.push_back(i);
do {
if (publish(a)) {
answer(a);
return;
}
} while(next_permutation(a.begin(), a.end()));
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
return 0;
}