C++生成全排列的库函数 next_permutation

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    
    
    int n ;
    int a[10000];
    while(cin>>n && n){
    
    
        for(int i=0;i<n;i++) cin>>a[i];
        sort(a,a+n);
        do {
    
    
            for(int i=0;i<n;i++) cout<<a[i]<<" ";
            cout<<endl;
        }while (next_permutation(a,a+n));
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_44846324/article/details/108868395