解题
运用STL中的next_permutation函数计算排列组合关系
#include "iostream" #include "algorithm" using namespace std; int n; int ans[1001]; int main() { cin >> n; int m = n; int k = 0; while (m != 0) { ans[k++] = m % 10; m = m / 10; } sort(ans, ans + k); do { for (int i = 0; i < k; i++) cout << ans[i]; cout << endl; } while (next_permutation(ans,ans+k)); return 0; }
0.0分
0 人评分