HDU 1342 Lotto
来源:互联网 发布:空姐工资 知乎 编辑:程序博客网 时间:2024/04/30 09:45
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1727 Accepted Submission(s): 848
Problem Description
In a Lotto I have ever played, one has 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.
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 file 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 78 1 2 3 5 8 13 21 340
Sample Output
1 2 3 4 5 61 2 3 4 5 71 2 3 4 6 71 2 3 5 6 71 2 4 5 6 71 3 4 5 6 72 3 4 5 6 71 2 3 5 8 131 2 3 5 8 211 2 3 5 8 341 2 3 5 13 211 2 3 5 13 341 2 3 5 21 341 2 3 8 13 211 2 3 8 13 341 2 3 8 21 341 2 3 13 21 341 2 5 8 13 211 2 5 8 13 341 2 5 8 21 341 2 5 13 21 341 2 8 13 21 341 3 5 8 13 211 3 5 8 13 341 3 5 8 21 341 3 5 13 21 341 3 8 13 21 341 5 8 13 21 342 3 5 8 13 212 3 5 8 13 342 3 5 8 21 342 3 5 13 21 342 3 8 13 21 342 5 8 13 21 343 5 8 13 21 34
AC代码:
第一种写法: 15ms
两重DFS 表该数选或者不选
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int N;int a[20];int b[10];void DFS(int num, int pos){ if(num == 7) { for(int i = 1; i <= 6; i++) { if(i > 1) printf(" "); printf("%d", b[i]); } printf("\n"); return ; } if(pos > N) return ; b[num] = a[pos]; DFS(num+1, pos+1);//选 DFS(num, pos+1);//不选}int main(){ int t = 0; while(scanf("%d", &N), N) { if(t > 0) printf("\n"); for(int i = 1; i <= N; i++) scanf("%d", &a[i]); DFS(1, 1); t++; } return 0;}
第二种写法: 0ms
回溯 表选择
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int N;int a[20];int b[10];void DFS(int num, int pos){ if(num == 7) { for(int i = 1; i <= 6; i++) { if(i > 1) printf(" "); printf("%d", b[i]); } printf("\n"); return ; } if(pos > N) return ; b[num] = a[pos]; num++; DFS(num, pos + 1); num--; DFS(num, pos + 1);}int main(){ int t = 0; while(scanf("%d", &N), N) { if(t > 0) printf("\n"); for(int i = 1; i <= N; i++) scanf("%d", &a[i]); DFS(1, 1); t++; } return 0;}
第三种写法:31ms
数组标记 回溯
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int N;int a[20];int b[10];bool used[20];void DFS(int num, int pos){ if(num == 7) { for(int i = 1; i <= 6; i++) { if(i > 1) printf(" "); printf("%d", b[i]); } printf("\n"); return ; } else { for(int i = pos; i <= N; i++) { if(used[i]) continue; used[i] = true; b[num] = a[i]; DFS(num+1, i+1); used[i] = false; } }}int main(){ int t = 0; while(scanf("%d", &N), N) { if(t > 0) printf("\n"); for(int i = 1; i <= N; i++) scanf("%d", &a[i]); memset(used, false, sizeof(used)); DFS(1, 1); t++; } return 0;}
0 0
- hdu--1342 lotto (dfs)
- hdu 1342 Lotto
- hdu-1342-Lotto(dfs)
- hdu-1342 Lotto
- hdu 1342 Lotto
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto-DFS
- hdu-1342 Lotto
- HDU 1342 Lotto
- HDU 1342 Lotto
- HDU 1342 Lotto
- HDU----1342(Lotto)
- HDU 1342 Lotto
- HDU 1342 Lotto (DFS)
- hdu--1342 lotto(回溯法)
- [ACM] hdu 1342 Lotto (排列)
- HDU 1342 Lotto
- 莱特币怎么挖
- 莱特币有哪些
- Rootstock与以太坊的智能合约之争
- 比特币手续费将提高 交易确认…
- 苹果电脑首遭病毒侵袭:加密文件后…
- HDU 1342 Lotto
- BTCPOP:全球第一家提供商业贷款的…
- 比特币沉寂两年弱复苏 虚拟币…
- 安卓-HandlerThread详解
- 比特币初创公司保险产品展示出了巨…
- 比特币初创公司保险产品展示出了巨…
- 最新研究表明比特币安全性令人堪忧
- Coinbase CEO:比特币的危机…
- 日本内阁官方承认比特币是一种货币…