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