# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721559 | Mardonbekhazratov | 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"
using namespace std;
void solve(int n){
vector<int>a(n);
for(int i=1;i<=n;i++) a[i-1]=i;
do{
if(publish(a)==0){
answer(a);
break;
}
}while(next_permutation(a.begin(),a.end()));
}