HDU 1342 Lotto(DFS)
来源:互联网 发布:人工智能假肢多少钱 编辑:程序博客网 时间:2024/05/17 23:54
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2999 Accepted Submission(s): 1426
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
Source
University of Ulm Local Contest 1996
Recommend
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 a[1100],b[1100];int n;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 i,j;while(scanf("%d", &n), n){for (i = 1; i <= n; i++){scanf("%d", &a[i]);}DFS(1, 1);}return 0;}
0 0
- HDU 1342 Lotto (dfs)
- HDU 1342 Lotto(DFS)
- hdu--1342 lotto (dfs)
- hdu-1342-Lotto(dfs)
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto-DFS
- HDU 1342 Lotto (DFS)
- HDOJ.1342 Lotto (DFS)
- HDU 1342--Lotto【DFS(递增全排列)】
- HDOJ 题目1342Lotto(DFS)
- 1342 Lotto【dfs】
- hd-1342:Lotto DFS
- hdoj--1342--Lotto(dfs)
- Lotto(DFS处理)
- Lotto(DFS)
- hdu 1342 Lotto(组合数搜索)
- hdu 1342 Lotto
- 移动App该如何保存用户密码
- 2017/2/22 基于SpringMVC和Mybatis的分页实现(1)
- svn客户端的详细使用
- 微信小程序(事件处理)
- 初学JavaWeb需要知道的目录结构与配置
- HDU 1342 Lotto(DFS)
- 时间转换
- 树莓派FTP文件传输小记
- mybaits 多个参数传入用#{0,1,....}或者@Param注释
- Disruptor框架入门
- Oracle的自动增长序列时提示 : ORA-02287: 此处不允许序号
- Servlet学习笔记
- iOS 异步图片加载优化与常用开源库分析
- ubuntu14.04不能上网“没有可用的网络设备”