ZOJ 1089--DFS--组合
来源:互联网 发布:js 获取子字符串 编辑:程序博客网 时间:2024/06/13 12:26
链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1089
ZOJ Problem Set - 1089
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 containingk (k>6) of these 49 numbers, and then play several games with choosing numbers only from S. For example, fork=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 Specification
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 numberk (6 <k < 13). Thenk integers, specifying the set S, will follow in ascending order. Input will be terminated by a value of zero (0) fork.Output Specification
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
#include<iostream>using namespace std;int a[20],cnt;int k,s[20];void dfs(int i){if(cnt==6){for(int j=0;j<5;j++) cout<<a[j]<<" "; cout<<a[5]<<endl;return;}if(i>=k) return;a[cnt++]=s[i];dfs(i+1);cnt--;dfs(i+1);}int main(){int flag=1;while(cin>>k&&k){if(!flag) cout<<endl;else flag=0;for(int i=0;i<k;i++) cin>>s[i]; cnt=0;dfs(0);}}
0 0
- ZOJ 1089--DFS--组合
- ZOJ 1711--DFS--组合--剪枝/去重
- zoj 1089 lotto (DFS )
- zoj 1089 || poj 2245 Lotto(DFS~)
- zoj 1457 dfs水题
- zoj 2100 dfs
- zoj 1711 dfs
- zoj 1204 dfs
- ZOJ 1005 Jugs (DFS)
- ZOJ 1011 NTA (DFS)
- zoj 2100 Seeding(dfs)
- 【DFS】ZOJ 1580 Sudoku
- zoj 1002 dfs
- zoj 1002 DFS
- ACM-ZOJ 2110 DFS
- zoj Farm Irrigation dfs
- ZOJ 2580 Sudoku (DFS)
- zoj 2110 DFS
- C语言格式化输入输出
- js 获取css 样式表属性
- 软件升级设计图
- zoj 3623 battle ships
- 删除CHROME
- ZOJ 1089--DFS--组合
- 在win7中配置eclipse连接Ubuntu内的hadoop
- js中字符串数据转为json对象的方法
- Java中RSA非对称密钥加解密使用示例
- 阿里巴巴菜鸟网络二面
- 图像特征知识结构
- ios 带边框的button
- Java Thread Pool
- poj 2060 Taxi Cab Scheme 最小路径覆盖