# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
982839 | 2024-05-14T19:33:21 Z | vjudge1 | 순열 (APIO22_perm) | C++17 | 0 ms | 0 KB |
//#include "perm.h" #include <bits/stdc++.h> using namespace std; std::vector<int> construct_permutation(long long k) { vector <int> resp; long long pot = 0, prev = 1; while (prev <= k) { pot = prev; prev *= 2; } long long diff = k - pot; for (long long i =(long long) (pot + diff) ; i > pot; i--) { resp.push_back(i); } for (int i = 0; i <= pot; i++) { resp.push_back(i); } return resp; } int main() { int k; cin>>k; vector <int> r = construct_permutation((long long)k); for(auto i: r) { cout<<i<<" "; } cout<<endl; }