hdu--1342 lotto (dfs)

#include "stdio.h"
#include "string.h"
#include "math.h"
int visit[14],save[6],a[14];
int n,cur;

void DFS(int cur,int start)
{
int i;
if(cur==6)
{
printf("%d",a[save[0]]);
for(i=1;i<6;i++) printf(" %d",a[save[i]]);
printf("/n");
}
else for(i=start+1;i<=n-1;i++)
{
save[cur]=i;
DFS(cur+1,i);
}
}

int main()
{
int i,j,m,b,f=0;
while(scanf("%d",&n)!=EOF&&n!=0)
{
for(i=0;i<n;i++) scanf("%d",&a[i]);
if(f) printf("/n");
memset(visit,0,sizeof(visit));
for (i=0;i<=n-6;i++)
{
save[0]=i;
DFS(1,i);
}
f=1;
}
return 0;
}