利用STL库的next_permutation()函数进行全排列的生成
#include <iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
int n, p[10];
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &p[i]);
}
sort(p, p + n);
do {
for (int i = 0; i < n; i++) {
printf("%d", p[i]);
}
printf("\n");
} while (next_permutation(p, p + n));
return 0;
}