解题思路:
next_permutation大法
注意事项:
参考代码:
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <queue> #include <algorithm> #include <stdio.h> #include <memory.h> using namespace std; vector<int> perm; int main() { int n = 0; cin >> n; for (int i = 0; i <= 9; i++) perm.push_back(i); int i = 1; do { i += 1; if (i == n + 1) { for (vector<int>::iterator it = perm.begin(); it < perm.end(); it++) cout << *it; cout << endl; break; } } while (next_permutation(perm.begin(),perm.end())); return 0; }
0.0分
1 人评分