Lotto--poj2245
2015-08-20 16:34
357 查看
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6605 | Accepted: 4185 |
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 #include<algorithm> 4 using namespace std; 5 int a[15],b[7],n; 6 7 void dfs(int num,int p) 8 { 9 int i; 10 if(p>n) 11 return ; 12 if(num>=6) 13 { 14 for(i=0;i<5;i++) 15 printf("%d ",b[i]); 16 printf("%d\n",b[5]); 17 return ; 18 } 19 b[num]=a[p]; 20 dfs(num+1,p+1); 21 dfs(num,p+1); 22 return; 23 } 24 int main() 25 { 26 int i,flag=0; 27 while(scanf("%d",&n),n) 28 { 29 if(flag) 30 printf("\n"); 31 flag=1; 32 for(i=0;i<n;i++) 33 scanf("%d",&a[i]); 34 35 dfs(0,0); 36 } 37 38 }
相关文章推荐
- Avoid The Lakes--poj3620
- Fire Net--hdu1045
- Seeding--zoj2100
- 变态最大值--nyoj题目811
- 独木舟上的旅行--nyoj题目71
- 过河问题--nyoj题目47
- 会场安排问题--nyoj题目14
- 今年暑假不AC--hdu2037
- 寻找最大数--nyoj题目448
- 喷水装置(一)--nyoj题目6
- ZOJ问题--hdu3788
- Cable master--hdu1551(二分法)
- Pie--hdu1969(二分法)
- Ice_cream&#39;s world I--hdu2120
- How Many Tables--hdu1213(并查集)
- 第17章 MVC模式与Struts2框架
- LeetCode--Search in Rotated Sorted Array
- 人物识别(2)
- apache http server 安装步骤
- SEO要领:8文章主持技巧(两)