POJ 2245 Lotto (枚举)
来源:互联网 发布:传智播客php笔记 编辑:程序博客网 时间:2024/05/15 12:40
Lotto
http://poj.org/problem?id=2245
Time Limit: 1000MS
Memory Limit: 65536K
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.
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 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
注意k<13,写一个六重循环没问题。
完整代码:
/*0ms,84KB*/#include <cstdio>int a[20];int main(void){int n, i, j, k, p, q, r;while (scanf("%d", &n), n){for (i = 1; i <= n; i++)scanf("%d", &a[i]);for (i = 1; i <= n - 5; i++)for (j = i + 1; j <= n - 4; j++)for (k = j + 1; k <= n - 3; k++)for (p = k + 1; p <= n - 2; p++)for (q = p + 1; q <= n - 1; q++)for (r = q + 1; r <= n; r++)printf("%d %d %d %d %d %d\n", a[i], a[j], a[k], a[p], a[q], a[r]);printf("\n");}return 0;}
- POJ 2245 Lotto (枚举)
- POJ 2245 Lotto
- poj 2245Lotto
- POJ 2245 Lotto
- poj 2245 Lotto
- poj 2245 lotto
- poj 2245 Lotto
- POJ 2245 Lotto DFS
- POJ 2245 Lotto
- Poj 2245—LOTTO
- 周赛 POJ 2245 Lotto
- poj 2245lotto(dfs)
- hdu1342 && poj 2245 Lotto
- poj 2245 Lotto
- POJ-2245-Lotto
- Lotto POJ-2245
- POJ 2245 Lotto 笔记
- POJ 2245 Lotto(组合问题)
- Oracle之/* ASSIST */用法
- poj 2411 Mondriaan's Dream(状态压缩DP)
- 变更控制流程图(PMP第五版)
- windows编程模型
- J.U.C包介绍
- POJ 2245 Lotto (枚举)
- poj——1019(数学)
- 关于C/C++函数指针声明的理解
- Steve Yegge:Google面试秘籍
- build/core/base_rules.mk:195: already define
- URAL 1635
- 分类算法之决策树
- Linux内核高端内存
- asp.net WebForm程序删除.designer.cs文件,重新设计并绑定服务端控件时间