POJ 2245 Lotto

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

// POJ 2245
// Tanky Woo
// www.wutianqi.com
#include<iostream>
#include<algorithm>
using namespace std;
int num[14];
int lotto[14];
int n,cnt;
 
void select_combination(int current,int p)//递归填充数并打
 
印组合,相当于DFS过程
{
int i;
if(6 == current)
{
for(i = 0; i < 6; ++i)
printf("%d ", lotto[i]);
printf("/n");
}
else
{
for(i = p; i < n; ++i)
{
lotto[current] = num[i];
select_combination(current+1,
 
i+1);
}
}
}
 
// www.wutianqi.com
int main()
{
//freopen("in.txt","r",stdin);
bool first = 1;
while(scanf("%d",&n) && n)
{
if(!first)  printf("/n");
first = 0;
 
for(int i = 0;i < n;++i)
scanf("%d",&num[i]);
select_combination(0,0);//递归调用从0 0开始
}
return 0;
}