POJ 2245 Lotto(水水的dfs)
2017-08-03 19:04
225 查看
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
题解:
好久没做过那么水的比赛题了qwq
代码:
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
题解:
好久没做过那么水的比赛题了qwq
代码:
#include<algorithm> #include<iostream> #include<cstring> #include<stdio.h> #include<math.h> #include<string> #include<stdio.h> #include<queue> #include<stack> #include<map> #include<deque> #define M (t[k].l+t[k].r)/2 #define lson k*2 #define rson k*2+1 using namespace std; int a[20]; int b[20]; int n; void dfs(int len,int index) { int i; if(len==6) { for(i=0;i<6;i++) { printf("%d",b[i]); if(i!=5) printf(" "); else printf("\n"); } return; } if(index>=n||len+n-index<6)//稍微枝剪一下,如果当前长加上后面所有长都小于6直接返回 return; b[len]=a[index]; dfs(len+1,index+1);//取了该数 dfs(len,index+1);//没取该数 } int main() { int i,j,k,tag=1; while(scanf("%d",&n)!=EOF&&n) { if(!tag) printf("\n"); for(i=0;i<n;i++) scanf("%d",&a[i]); dfs(0,0); tag=0; } return 0; }
相关文章推荐
- poj 2245 Lotto dfs
- POJ 2245 Lotto-DFS-(回溯法)
- zoj 1089 || poj 2245 Lotto(DFS~)
- poj 2245lotto(dfs)
- POJ 题目2245 Lotto(DFS水)
- POJ 2245 Lotto DFS
- POJ 2245 Lotto DFS
- POJ 2245 Lotto dfs
- ACM POJ 2245Lotto解题报告
- Poj 2245—LOTTO
- poj 1496(1850)/2245 全组合打表(一种字符编码/Lotto)
- hdu1342 && poj 2245 Lotto
- POJ-2245-Lotto
- POJ 2245 Lotto 笔记
- POJ 2245 Lotto
- POJ 2245 Lotto
- poj 2245 Lotto
- 周赛 POJ 2245 Lotto
- poj 2245 Lotto
- poj 2245 Lotto