hdoj--1342--Lotto(dfs)
2015-12-12 11:37
489 查看
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1887 Accepted Submission(s): 919
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
7 1 2 3 4 5 6 7 8 1 2 3 5 8 13 21 34 0
[align=left]Sample Output[/align]
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
[align=left]Source[/align]
University of Ulm Local Contest 1996
[align=left]Recommend[/align]
JGShining | We have carefully selected several similar problems for you: 1346 1361 1374 1370 1347
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int n,num[10010],a[10010],vis[10010]; void dfs(int p,int d) { if(d==6) { for(int i=0;i<=5;i++) { if(i) printf(" "); printf("%d",a[i]); } printf("\n"); return ; } if(p>=n) return ; for(int i=p;i<n;i++) { if(!vis[i]) { vis[i]=1; a[d]=num[i]; dfs(i+1,d+1); vis[i]=0; } } } int main() { int flog=0; while(scanf("%d",&n),n) { if(flog) printf("\n"); flog=1; memset(num,0,sizeof(num)); memset(vis,0,sizeof(vis)); memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%d",&num[i]); sort(num,num+n); dfs(0,0); } return 0; }
相关文章推荐
- JAVA随堂笔记课【三】:面向对象
- 工厂方法(Factory Method)模式
- 压缩跟踪Compressive Tracking
- 欢迎使用CSDN-markdown编辑器
- 10_排序二叉树删除-2
- Swift注释风格
- Linux之用户及文件权限管理
- UITextKit框架的学习(一)
- 浅谈依赖注入
- 读取系统所有 图片 和缩略图
- 关于Windous和Linux的ping的若干问题解决
- 一行代码实现IOS 3DES加密解密
- UICollectionView 瀑布流 初级
- MyBatis传入多个参数的问题
- 《代码阅读方法与实践》阅读笔记二
- 压缩感知(Compressive Sensing)学习之(二)
- 关于“宏定义”的作用范围
- java 搭建web项目
- IOS获取当前位置坐标不执行代理方法
- 压缩感知(Compressive Sensing)学习之(一)