hdoj 1716 排列2 【STL】

题目链接：hdoj 1716 排列2

$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef long long LL;
typedef pair<int, char> pii;
const int MAXN = 1e7+10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void getmax(int &a, int b) {a = max(a, b); }
void getmin(int &a, int b) {a = min(a, b); }
void add(LL &x, LL y) { x += y; x %= MOD; }
map<int, bool> fp;
bool use[10];
int a[4], b[4], c[4];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int num = 0;
    while(cin >> a[0] >> a[1] >> a[2] >> a[3])
    {
        if(a[0] == 0 && a[1] == 0 && a[2] == 0 && a[3] == 0) break;
        if(num) cout << endl; num = 1;
        fp.clear(); CLR(use, false);
        sort(a, a+4);
        for(int j = 0; j < 4; j++) {
            int v = a[j];
            if(use[v] || v == 0) continue;
            use[v] = true;
            memcpy(b, a, sizeof(a));
            sort(b, b+4);
            c[0] = v; int top = 1; bool flag = false;
            for(int i = 0; i < 4; i++) {
                if(b[i] == v && !flag) {
                    flag = true;
                    continue;
                }
                c[top++] = b[i];
            }int cnt = 0;
            do {
                if(cnt) cout << " "; cnt++;
                cout << v;
                for(int i = 1; i < 4; i++)
                    cout << c[i];
            }while(next_permutation(c+1, c+4));
            cout << endl;
        }
    }
    return 0;
}