POJ 题目2245 Lotto(DFS水)
来源:互联网 发布:360调价软件 编辑:程序博客网 时间:2024/04/29 11:06
Lotto
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6549 Accepted: 4153
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
各种水
#include<stdio.h>#include<string.h>int n;int a[50],b[50];void dfs(int pos,int num){int i,j;if(n-pos+1<6-num)return;if(num==6){printf("%d",b[0]);for(i=1;i<6;i++)printf(" %d",b[i]);printf("\n");return;}b[num]=a[pos];dfs(pos+1,num+1);dfs(pos+1,num);}int main(){//int nint flag=0;while(scanf("%d",&n)!=EOF,n){int i;if(flag)printf("\n");elseflag=1;for(i=1;i<=n;i++){scanf("%d",&a[i]);}dfs(1,0);//printf("\n");}return 0;}
1 0
- POJ 题目2245 Lotto(DFS水)
- POJ 2245 Lotto DFS
- poj 2245lotto(dfs)
- POJ 2245 Lotto(水水的dfs)
- zoj 1089 || poj 2245 Lotto(DFS~)
- POJ 2245 Lotto-DFS-(回溯法)
- HDOJ 题目1342Lotto(DFS)
- POJ 2245 Lotto(组合数dfs)
- Lotto(DFS处理)
- Lotto(DFS)
- POJ 2245 Lotto
- poj 2245Lotto
- POJ 2245 Lotto
- POJ 2245 Lotto (枚举)
- poj 2245 Lotto
- poj 2245 lotto
- poj 2245 Lotto
- POJ 2245 Lotto
- Emag eht htiw Em Pleh(POJ--2993
- Linux\AIX 常用
- iOS一个UILabel 显示两种字体和颜色
- ios ScrollerView之图片轮播器
- 支付宝RSA验证失败的问题
- POJ 题目2245 Lotto(DFS水)
- 虚函数,纯虚函数
- 动态规划原理 数据结构
- OSG 目前所支持的场景筛选方式
- iOS9适配系列教程
- http://blog.sina.com.cn/s/blog_618199e60100y537.html
- kthread_run函数
- [leetcode] Lowest Common Ancestor of a Binary Search Tree
- C# 中 将 byte数组数据转变成图像