next_permutation

94. 递归实现排列型枚举 - AcWing题库

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