POJ2245Lotto
来源:互联网 发布:c语言中最大公约数 编辑:程序博客网 时间:2024/06/01 22:21
易水人去,明月如霜
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思路:枚举大小为6的子集
代码:
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[55],b[55],vis[55],k; void dfs(int c,int num){ if(num>6){ printf("%d",b[1]); for(int i=2;i<=6;i++) printf(" %d",b[i]); printf("\n"); }else{ for(int i=c;i<k;i++){ if(!vis[i]){ b[num]=a[i]; vis[i]=1; dfs(i,num+1); vis[i]=0; } } } } int main(){ int i,Case=0; while(scanf("%d",&k),k){ if(Case++) printf("\n"); for(i=0;i<k;i++) scanf("%d",&a[i]); sort(a,a+k); memset(vis,0,sizeof(vis)); memset(b,0,sizeof(b)); dfs(0,1); } return 0; }
0 0
- poj2245lotto
- POJ2245Lotto
- poj2245Lotto(dfs)
- hdu1342&poj2245Lotto - dfs
- poj2245Lotto(最基础的dfs)
- Java_RandomAccessFile和IO流
- Easy-14
- 矩阵中的路径
- 1.docker的安装
- 机器人的运动范围
- POJ2245Lotto
- 腾讯云服务器的配置与部署(二):MySQL的配置安装、云服务器与云数据库的连接
- C++11 lambda 表达式解析
- Mysql like 用法
- unit7~~访问网络文件共享服务
- CSS实现常用菜单(二)
- 常用Java设计模式系列(4)- 适配器模式
- 大声的喊——NOI2017,我来了!
- Jsp连接MySQL 题外篇