HDU----1342(Lotto)
来源:互联网 发布:c语言中switch是什么 编辑:程序博客网 时间:2024/05/18 00:58
Lotto
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3192 Accepted Submission(s): 1507
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
Source
University of Ulm Local Contest 1996
我真的是受不了自己了
#include<bits/stdc++.h>using namespace std;int main(){ int f=1,n,a[150]; while(~scanf("%d",&n)&&n) { for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); if(f) f=0; else printf("\n"); for(int i1=0;i1<n-5;i1++) for(int i2=i1+1;i2<n-4;i2++) for(int i3=i2+1;i3<n-3;i3++) for(int i4=i3+1;i4<n-2;i4++) for(int i5=i4+1;i5<n-1;i5++) for(int i6=i5+1;i6<n;i6++) printf("%d %d %d %d %d %d\n",a[i1],a[i2],a[i3],a[i4],a[i5],a[i6]); } 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
- 文章标题
- Javascript 获取当前JS文件路径
- Ubuntu下命令行安装Python3
- Java开源框架---Spring【1】
- LeetCode 3. Longest Substring Without Repeating Characters
- HDU----1342(Lotto)
- linux配置文件说明
- 为什么有的人工作多年还是老样子
- java.lang.OutOfMemoryError报错
- linux常见服务
- Linux磁盘管理(一) inode
- ISO/IEC 14443协议浅谈
- 每天一个Linux命令(11):head命令
- summary