【小米oj】简单直接全排列

用c++ next_permutation函数就可以了。

#define mm(a) memset(a,0,sizeof(a));
#define max(x,y) (x)>(y)?(x):(y)
#define min(x,y) (x)<(y)?(x):(y)
#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#include<bits/stdc++.h>
typedef long long ll;
#define PII pair<ll,ll>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=(int)2e5 + 5;
const ll mod=1e9+7;


string input,temp;
vector<int>v;
map<int,int>mp;
int n,dp[MAXN],m;
int main() {
    while (cin >> input) {
        istringstream iss(input);
        v.clear();
        v.push_back(0);
        mp.clear();
        while (getline(iss, temp, ',')) {
            int x=atoi(temp.c_str());
            v.push_back(x);
        }
        n=v.size()-1;
        sort(v.begin(),v.end());
        int flag=0;
        do {
            if(flag)printf(";");
            else flag=1;
            for(int i=1; i<=n; i++) {
                if(i!=1)printf(",");
                printf("%d",v[i]);
            }
        } while(next_permutation(v.begin()+1,v.end()));
    }
    return 0;
}