全排列

/*next_permutation
next_permutation
next_permutation
*/
#include<bits/stdc++.h>
using namespace std;

int n,a[502000];

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