ZOJ 1089 Lotto

#include <stdio.h>
#include <string.h>

void dfs(int num[], int n, int index, int cnt, bool mark[])
{
if (cnt == 6)
{
bool bFirst = true;
for (int i = 0; i < n; i++)
{
if (mark[i] == true)
{
if (bFirst == false)
{
printf(" ");
}
printf("%d", num[i]);
bFirst = false;
}

}

printf("\n");
}
else
{
if (index < n && n - index + 1 >= 6 - cnt)
{
if (mark[index] == false)
{
mark[index] = true;
dfs(num, n, index + 1, cnt + 1, mark);
mark[index] = false;
}

dfs(num, n, index + 1, cnt, mark);
}
}
}

int main()
{
int n;

bool bFirst = true;

while (scanf("%d", &n), n > 0)
{
if (bFirst == false)
{
printf("\n");
}
bFirst = false;

int num[13] = {0};
bool mark[13];

memset(mark, false, 13 * sizeof(bool));

for (int i = 0; i < n; i++)
{
scanf("%d", &num[i]);
}

dfs(num, n, 0, 0, mark);
}

return 0;
}