标签：
Lotto
Description
In the German Lotto you have to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn‘t increase your chance of winning - is to select a subset S containing k (k > 6) of these 49 numbers, and then play several games with choosing numbers only from S. For example, for k=8 and S = {1,2,3,5,8,13,21,34} there are 28 possible games: [1,2,3,5,8,13], [1,2,3,5,8,21], [1,2,3,5,8,34], [1,2,3,5,13,21], ... [3,5,8,13,21,34].
Your job is to write a program that reads in the number k and the
set S and then prints all possible games choosing numbers only from S.
Input
The
input will contain one or more test cases. Each test case consists of
one line containing several integers separated from each other by
spaces. The first integer on the line will be the number k (6 < k
< 13). Then k integers, specifying the set S, will follow in
ascending order. Input will be terminated by a value of zero (0) for k.
Output
For
each test case, print all possible games, each game on one line. The
numbers of each game have to be sorted in ascending order and separated
from each other by exactly one space. The games themselves have to be
sorted lexicographically, that means sorted by the lowest number first,
then by the second lowest and so on, as demonstrated in the sample
output below. The test cases have to be separated from each other by
exactly one blank line. Do not put a blank line after the last test
case.
Sample Input
7 1 2 3 4 5 6 7
8 1 2 3 5 8 13 21 34
0
Sample Output
1 2 3 4 5 6
1 2 3 4 5 7
1 2 3 4 6 7
1 2 3 5 6 7
1 2 4 5 6 7
1 3 4 5 6 7
2 3 4 5 6 7
1 2 3 5 8 13
1 2 3 5 8 21
1 2 3 5 8 34
1 2 3 5 13 21
1 2 3 5 13 34
1 2 3 5 21 34
1 2 3 8 13 21
1 2 3 8 13 34
1 2 3 8 21 34
1 2 3 13 21 34
1 2 5 8 13 21
1 2 5 8 13 34
1 2 5 8 21 34
1 2 5 13 21 34
1 2 8 13 21 34
1 3 5 8 13 21
1 3 5 8 13 34
1 3 5 8 21 34
1 3 5 13 21 34
1 3 8 13 21 34
1 5 8 13 21 34
2 3 5 8 13 21
2 3 5 8 13 34
2 3 5 8 21 34
2 3 5 13 21 34
2 3 8 13 21 34
2 5 8 13 21 34
3 5 8 13 21 34
1 #include<cstdio>
2 #include<cstring>
3 using namespace std;
4
5 int n,a[15],b[15],used[15];
6
7 void dfs(int cur,int num)
8 {
9 int i,j;
10 if(cur==num)
11 {
12 for(j=0;j<num-1;j++)
13 printf("%d ",b[j]);
14 printf("%d\n",b[j]);
15 return;
16 }
17 for(i=0;i<n;i++)
18 {
19 if(!used[i]&&a[i]>b[cur-1])
20 {
21 b[cur]=a[i];
22 used[i]=1;
23 dfs(cur+1,num);
24 used[i]=0;
25 }
26 }
27 }
28
29 int main()
30 {
31 bool flag;
32 flag=false;
33 while(scanf("%d",&n)&&n)
34 {
35 if(flag)
36 printf("\n");
37 memset(used,0,sizeof(used));
38 for(int i=0;i<n;i++)
39 scanf("%d",&a[i]);
40 dfs(0,6);
41 flag=true;
42 }
43 return 0;
44 }
POJ 2245 Lotto
标签：
原文地址：http://www.cnblogs.com/homura/p/4703513.html
