HDU 1342 Lotto
来源:互联网 发布:linux和windows的优劣 编辑:程序博客网 时间:2024/04/30 11:44
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1889 Accepted Submission(s): 921
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
题解:对数据进行从小到大排列,由于输入的数据是有序的,所以不用排序,采用dfs进行选择。
ACCode:
#include <cstdio>#include <iostream>#include <cmath>#include <cstring>using namespace std;int num[15], t;int res[6];void dfs(int step, int pos){ if(step>5) { for(int i=0; i<5; i++) { cout<<res[i]<<" "; } cout<<res[5]<<endl; }else { for(int i=pos; i<t; i++) { res[step] = num[i]; dfs(step+1, i+1); } }}int main(){ int flag=0; while(cin>>t && t) { if(flag) cout<<endl; //注意空行 for(int i=0; i<t; i++) { cin>>num[i]; } dfs(0,0); flag = 1; } return 0;}
0 0
- hdu--1342 lotto (dfs)
- hdu 1342 Lotto
- hdu-1342-Lotto(dfs)
- hdu-1342 Lotto
- hdu 1342 Lotto
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto 【DFS】
- HDU 1342 Lotto-DFS
- hdu-1342 Lotto
- HDU 1342 Lotto
- HDU 1342 Lotto
- HDU 1342 Lotto
- HDU----1342(Lotto)
- HDU 1342 Lotto
- HDU 1342 Lotto (DFS)
- hdu--1342 lotto(回溯法)
- [ACM] hdu 1342 Lotto (排列)
- HDU 1342 Lotto
- 【LWJGL官方教程】游戏逻辑
- 记录iOS的消息推送
- 2015-12-13复习之CSS3选择器
- 补码
- C语言总结
- HDU 1342 Lotto
- btrfs 使用指南 - 1 概念,创建,块设备管理,性能优化
- bzoj1854[Scoi2010]游戏
- Company A面试 笔试 : 爬山 算步骤 问题
- servlet复习(二)HTTP Servlet API
- 使用golang的标准库搭建网站--3.模板函数
- 三大图片缓存库对比
- 通过wireshark,以及python代码收发邮件,了解smtp协议,pop协议工作过程
- LeetCode(110) Balanced Binary Tree解题报告