#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> construct_permutation(long long k) {
if (k == 1) {
return {};
}
vector<int> nums = {2, 3, 5, 7};
for (auto p: nums) {
if (k % p == 0 && k > p) {
vector<int> res1 = construct_permutation(k / p);
int n = res1.size();
vector<int> res2 = construct_permutation(p);
for (auto &x: res2) {
x += n;
}
res1.insert(res1.end(), res2.begin(), res2.end());
return res1;
}
}
vector<int> res = construct_permutation(k / 2);
int n = res.size();
res.push_back(n);
if (k % 2 == 1) {
for (auto &x: res) {
x++;
}
res.push_back(0);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Correct |
2 ms |
352 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
12 |
Correct |
2 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
340 KB |
Output is correct |