poj 2245 水题

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
int N,m,t;
int a[15],vis[15];
void dfs(int st,int n)
{
int i;
if(n==6)    //已选择6个
{
int fl=1;
for(i=1;i<=N;i++)
{
if(vis[i])
{
if(fl)  printf("%d",a[i]),fl=0;
else printf(" %d",a[i]);
}
}
printf("\n");
return;
}
for(i=st;i<=N;i++)
{
if(!vis[i])
{
vis[i]=1;
dfs(i+1,n+1);
vis[i]=0;
}
}
}
int main()
{
int i,j,k=0;
//freopen("1.in","r",stdin);
while(scanf("%d",&N)!=EOF&&N>0)
{
memset(vis,0,sizeof(vis));
if(k++) printf("\n");
for(i=1;i<=N;i++)   cin>>a[i];
dfs(1,0);
}
return 0;
}