周赛 POJ 2245 Lotto
来源:互联网 发布:网络订机票 编辑:程序博客网 时间:2024/05/29 13:05
Description
In the German Lotto you have 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 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
Ulm Local 1996
简单的DFS。。。
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<limits.h>using namespace std;int num[15],a[15],k;int visit[15];void dfs(int l,int s){ if(s==6) { for(int i=0;i<6;i++) printf(i==5?"%d\n":"%d ",num[i]); } for(int i=l;i<k;i++) { if(!visit[i]) { visit[i]=1; num[s]=a[i]; dfs(i,s+1); visit[i]=0; } }}int main(){ while(cin>>k&&k) { for(int i=0;i<k;i++) cin>>a[i]; for(int i=0;i<=k-6;i++) { memset(visit,0,sizeof(visit)); visit[i]=1; num[0]=a[i]; dfs(i+1,1); } cout<<endl; } return 0;}
1 1
- 周赛 POJ 2245 Lotto
- POJ 2245 Lotto
- poj 2245Lotto
- POJ 2245 Lotto
- POJ 2245 Lotto (枚举)
- poj 2245 Lotto
- poj 2245 lotto
- poj 2245 Lotto
- POJ 2245 Lotto DFS
- POJ 2245 Lotto
- Poj 2245—LOTTO
- poj 2245lotto(dfs)
- hdu1342 && poj 2245 Lotto
- poj 2245 Lotto
- POJ-2245-Lotto
- Lotto POJ-2245
- POJ 2245 Lotto 笔记
- POJ 2245 Lotto(组合问题)
- POJ 1061 青蛙的约会
- POJ2255 Tree Recovery 【树的遍历】
- Comet:HTTP长连接
- Oracle ORA-22804】使用DBLINK访问LOB类型表
- yaffs2文件系统的制作
- 周赛 POJ 2245 Lotto
- Java 得到某一日期的前一天 后一天 并得到该三天分别是星期几
- ios--摄像头使用--UIImagePickerController
- POJ 1731 Orders
- 深入理解C++中的mutable关键字
- Linux一点了解之vmlinuz和initrd.img文件
- 【PhoneGap JQM】android app not working on android 4 (D/chromium( 3938): Unknown chromium error
- Linux下安装mysql-python并使用mysql
- [译]关于iOS和OS X废弃的API你需要知道的一切