HDU 1342 Lotto
2016-04-18 22:19
369 查看
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.
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 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
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; }
相关文章推荐
- C#编程中枚举类型的使用教程
- 枚举的用法详细总结
- PHP中Enum(枚举)用法实例详解
- c#入门之枚举和结构体使用详解(控制台接收字符串以相反的方向输出)
- 理解C#中的枚举(简明易懂)
- C#枚举中的位运算权限分配浅谈
- C++基础入门教程(四):枚举和指针
- FileShare枚举的使用小结(文件读写锁)
- Java枚举类用法实例
- 枚举窗口句柄后关闭所有窗口示例
- Win2003利用dfs(分布式文件系统)在负载均衡下的文件同步配置方案
- javascript模拟枚举的简单实例
- 深入剖析JavaScript中的枚举功能
- 枚举和宏的区别详细解析
- 深入理解C#中的枚举
- C#实现获取枚举中元素个数的方法
- 结合C++11的新特性来解析C++中的枚举与联合
- java中枚举的详细使用介绍
- java枚举的使用示例
- Java枚举详解及使用实例(涵盖了所有典型用法)