hdoj 1342 Lotto 【全排列（从n个数中选m个数按字典需排列）】

Lotto

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1835    Accepted Submission(s): 893

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.

 

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 7
8 1 2 3 5 8 13 21 34
0
  
  

 

Sample Output

  
  

   
   1 2 3 4 5 6
1 2 3 4 5 7
1 2 3 4 6 7
1 2 3 5 6 7
1 2 4 5 6 7
1 3 4 5 6 7
2 3 4 5 6 7

1 2 3 5 8 13
1 2 3 5 8 21
1 2 3 5 8 34
1 2 3 5 13 21
1 2 3 5 13 34
1 2 3 5 21 34
1 2 3 8 13 21
1 2 3 8 13 34
1 2 3 8 21 34
1 2 3 13 21 34
1 2 5 8 13 21
1 2 5 8 13 34
1 2 5 8 21 34
1 2 5 13 21 34
1 2 8 13 21 34
1 3 5 8 13 21
1 3 5 8 13 34
1 3 5 8 21 34
1 3 5 13 21 34
1 3 8 13 21 34
1 5 8 13 21 34
2 3 5 8 13 21
2 3 5 8 13 34
2 3 5 8 21 34
2 3 5 13 21 34
2 3 8 13 21 34
2 5 8 13 21 34
3 5 8 13 21 34
  
  

 

Source

University of Ulm Local Contest 1996

 

思路：

 

            就之不过把一般的全排列代码加了一个限制条件，就OK了！

代码：

 

        

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int n;
int a[15];
int vis[15];
int b[15];
int flag;
void dfs(int num)
{
	if(num==6)
	{
		for(int i=0;i<5;i++)
		{
			printf("%d ",b[i]);
		}
		printf("%d\n",b[5]);
		return;
	}
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			vis[i]=1;
			b[num]=a[i];
			if(num==0||b[num]>b[num-1])//这一点要注意！是这一道题的核心！ 
			dfs(num+1);
			vis[i]=0;
		}
	}
}

int main()
{
	flag=0;
	while(scanf("%d",&n)&&n)
	{
		if(flag==0)//输出格式要注意！ 
			flag=1;
		else
			printf("\n");
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		dfs(0);
	}
	return 0;
}