【HDOJ】1716 排列2

STL。

 /* 1716 */
 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 #include <cstring>
 using namespace std;

 #define MAXN 30
 int b[MAXN];

 int main() {
     int a[];
     int t = , n;
     int i, j, k;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     while () {
         j = ;
         for (i=; i<; ++i) {
             scanf("%d", &a[i]);
             j += a[i];
         }
         if (j == )
             break;
         if (t++)
             printf("\n");
         sort(a, a+);
         n = ;
         do {
             if (a[]) {
                 b[n++] = *a[]+*a[]+*a[]+a[];
             }
         } while (next_permutation(a, a+));
         b[n] = ;
         for (i=; i<n; ++i) {
             j = b[i]/;
             k = b[i+]/;
             if (j == k)
                 printf("%d ", b[i]);
             else
                 printf("%d\n", b[i]);
         }
     }

     return ;
 }