#include <bits/stdc++.h>
using namespace std;
int main()//by AGOMG
{
    int n, num[15];
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> num[i];
    }
    sort(num + 1, num + n + 1);
    do
    {
        for(int i = 1; i <= n; i++)
        {
            cout << num[i] << ' ';
        }
        cout << endl;
    } while(next_permutation(num + 1, num + n + 1));
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int num[20];
int main()
{
    int n;
    cin>>n;
    for (int i = 1; i <= n; i++)cin>>num[i];
    sort(num,num+n+1);
    do
    {
        for (int i = 1; i <= n; i++) 
            cout << num[i]<<" ";
        cout << endl;
    } while (next_permutation(num + 1, num + n+1)); 
    return 0;
}

要记得排序哦！😄

十分EZ 只要sort（）一下就AC 和常规题目相比就是不给你排好的数据 人家不给啥你就造呗~~

代码如下

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int a[15],n;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a,a+n+1);
    do
    {
        for(int i=1;i<=n;i++)cout<<a[i]<<' ';
        cout<<endl;
    }while(next_permutation(a+1,a+n+1));
    return 0;
}

AC代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[11];
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    do{
        for(int i=1;i<=n;i++){
            cout<<a[i]<<" ";
        }
        cout<<endl;
    }while(next_permutation(a+1,a+n+1));
    return 0;
}

#include <iostream>//hetao3097453
#include <algorithm>
using namespace std;
int num[10];
int main()
{
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> num[i];
    }
    sort(num + 1,num + n + 1);
    do
    {
        for(int i = 1;i <= n;i++)
        {
            cout << num[i] << " ";
        }
        cout << endl;
    } while(next_permutation(num + 1,num + n + 1));
    return 0;
}