zoj 1089 Lotto

/*************************
 * Author:fisty
 * Data: 2014-10-3
 * DFS
 * zoj1089
 * ***********************/

#include <cstdio>
#include <cstring>
using namespace std;

#define MAX_N 50

int a[MAX_N];
int s[MAX_N];
int used[MAX_N];
int n;
void dfs(int i,int k){
        if(i == 7){
                //满足条件  输出
                for(int j = 1;j <= 6; j++)
                        printf("%d%c",s[j],(j == 6) ? '\n' : ' ');    
        }
        else {
                //在n中选
                for(int j = k;j <= n; j++){
                        if(!used[j]){
                                s[i] = a[j];
                                used[j] = 1;
                                dfs(i+1, j);
                                used[j] = 0;
                        }
                }
        }
}
int main(){
        scanf("%d", &n);
        while(1){
                if(n == 0) break;
                for(int i = 1;i <= n; i++)
                        scanf("%d", &a[i]);
                memset(used, 0, sizeof(used));
                dfs(1,1);
                scanf("%d", &n);
                if(n) 
                        printf("\n");
        }
        return 0;
}