全排列函数(next_permutation)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int a[10];
    int n;
    scanf("%d",&n);
    for(int i = 1; i <= n ; i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);
     do{
        for(int i = 1; i < n ;i++)
            printf("%d ", a[i]);
          printf("%d
", a[n]);
    }
    while(next_permutation(a+1,a+n+1));
 return 0;
}
View Code
原文地址:https://www.cnblogs.com/zero-begin/p/4426073.html