POJ2245 Lotto【DFS】

最新推荐文章于 2019-10-24 21:29:21 发布

原创最新推荐文章于 2019-10-24 21:29:21 发布 · 426 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

算法专栏收录该内容

356 篇文章

订阅专栏

博客围绕德国乐透问题展开，需从给定的k个数中选6个数并打印所有组合方案。输入包含多组测试用例，k=0结束输入。题解采用DFS方法，并给出了AC的C++代码。

Lotto

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions:7111		Accepted: 4486

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.

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 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

Ulm Local 1996

问题链接：POJ2245 Lotto

问题大意：给你k个数（递增顺序），从中选择6个数，打印所有的组合方案。k=0表示输入结束，打印时每两个数之间才有空格，并且每个测试之间有一个空行。

题解：使用DFS

AC的C++代码：

#include<iostream>
#include<cstring>

using namespace std;
const int N=14;

bool vis[N],ans[N],a[N];
int n;

void dfs(int i,int k)//从第i个数开始搜索，已经组合了k个数 
{
	if(k==6){//已经组合了6个数了求打印 
		printf("%d",ans[0]);
		for(int j=1;j<6;j++)
		  printf(" %d",ans[j]);
		printf("\n");
		return;
	}
	for(;i<n;i++)
	  if(!vis[i]){
	  	vis[i]=true;
	  	ans[k]=a[i];
	  	dfs(i+1,k+1);
	  	vis[i]=false;
	  }
}

int main()
{
	bool flag=false;
	while(scanf("%d",&n)!=EOF&&n){
		for(int i=0;i<n;i++)
		  scanf("%d",&a[i]);
		if(flag)
		  printf("\n"); //每个测试之间有一个空行
		flag=true;
		memset(vis,false,sizeof(vis));
		dfs(0,0);
	}
	return 0;
}