Lotto

最新推荐文章于 2018-03-22 18:50:34 发布

原创最新推荐文章于 2018-03-22 18:50:34 发布 · 308 阅读

0 ·

CC 4.0 BY-SA版权

搜索专栏收录该内容

37 篇文章

订阅专栏

本文介绍了一个简单的深搜算法实现，用于生成Lotto游戏中指定数量的所有可能组合。该算法接收一组特定数量的数字，并从中选择固定数量的子集进行输出，展示了如何通过递归实现所有组合的枚举。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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,131,2,3,5,8,13, 1,2,3,5,8,211,2,3,5,8,21, 1,2,3,5,8,341,2,3,5,8,34, 1,2,3,5,13,211,2,3,5,13,21, ... 3,5,8,13,21,343,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

问题分析：一个简单的深搜，但是要注意输出格式，这里只有在每次输入新数据前判断要不要空行，而第一次的时候前面不用空行，用一个flag=0，表示不空行，第一次过后flag=1，之后一次来判断要不要有空行

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;

int k;
int num[15];
int choose[15];
int book[15];

void dfs(int x,int n)
{
	if (n == 6)
	{
		for(int i=0; i<6; i++)
			printf("%d%c",choose[i],i==5?10:32);
		return ;
	}	
	
	for(int i=x; i<k; i++)
	{
		if (book[i] == 0)
		{
			choose[n] = num[i];
			book[i] = 1;
			dfs(i+1,n+1);
			book[i] = 0;
		}
	}
}

int main()
{
	int flag = 0;
	while(~scanf("%d",&k))
	{
		if (k == 0)
			break;
		if (flag)	
			printf("\n");
		else
			flag = 1;
		for(int i=0; i<k; i++)
			scanf("%d",&num[i]);
		memset(book,0,sizeof(book));
		for(int i=0; i<k-5; i++)
		{
			choose[0] = num[i];
			book[i] = 1; 
			dfs(i+1,1);
			book[i] = 0;
		}
	}
	return 0;
}