HDU 1342 Lotto (dfs)
来源:互联网 发布:加拿大游戏公司 知乎 编辑:程序博客网 时间:2024/05/18 00:56
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2922 Accepted Submission(s): 1379
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
题解:dfs
代码:
#include<cstdio>int a[20],n,v[6],size;void dfs(int i,int num){ if(i>n) return ; if(num==6){ for(int i=0;i<5;i++) printf("%d ",v[i]); printf("%d\n",v[5]); return ; } v[size++]=a[i]; dfs(i+1,num+1); size--; dfs(i+1,num);}int main(){ int cas=0; while(~scanf("%d",&n),n){ size=0; if(cas++) puts(""); for(int i=0;i<n;i++) scanf("%d",&a[i]); dfs(0,0); } return 0;}
1 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
- 【Java多线程与并发库】4.传统线程同步通信技术
- 您只能在 HTML 输出流中使用 document.write。 如果您在文档已加载后使用它(比如在函数中),会覆盖整个文档。
- 加密技术之PGP与邮件加密
- 在GitHub上托管项目
- Objective-C编译成C++代码报错
- HDU 1342 Lotto (dfs)
- 博客搬家了
- POJ Strange Way to Express Integers 2891(扩展欧几里得)
- HttpClient post方式,添加请求参数
- 数据结构(九)
- android studio添加代码(类)注释功能
- Unity 音乐可视化(音乐频谱控制物体的运动)
- linux普通用户使用1024以下的端口(80)
- Java基础2——语法