全排列函数(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\n", a[n]);
    }
    while(next_permutation(a+1,a+n+1));
 return 0;
}
View Code

 

posted @ 2015-04-14 21:14  Painting、时光  阅读(128)  评论(0编辑  收藏  举报