Lotto

Lotto Time Limit: 2 Seconds      Memory Limit: 65536 KB 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 Specification 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 Specification 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

分析：枚举，

0 1 2 3 4 5 6 ... n-6 n-5 n-4 n-3 n-2 n-1

因为只选择6个数，且数据范围小，所以可以枚举

枚举的第一个数a一定只能在[0,n-6]中选

枚举的第二个数b一定只能在[a+1,n-5]中选 ，因为是升序，所以左区间是a+1，右区间可以这样确定，假设我选择的是n-4或者后面的数，那么第三个数得右区间最小就只能选n-3，相应的第四个是n-2，第五个是n-1第六个就没得选了，所以，可以确定第二个数的右区间是n-5,

后面一次类推。

#include<cstdio>
#include<cstring>
const int MaxN = 1001;
int main()
{
	int i, j,n;
	int num[MaxN];
	int line = 0;
	while (scanf("%d",&n) && n)
	{
		if (line) printf("\n");
		for (i = 0; i < n; i++) scanf("%d", &num[i]);
		int a, b, c, d, e, f;
		for(a=0;a<=n-6;a++)
		for(b=a+1;b<=n-5;b++)
		for(c=b+1;c<=n-4;c++)
		for(d=c+1;d<=n-3;d++)
		for(e=d+1;e<=n-2;e++)
			for (f = e + 1; f <= n - 1; f++)
			{
				printf("%d %d %d %d %d %d\n", num[a], num[b], num[c], num[d], num[e], num[f]);
			}
		line = 1;
	}
	return 0;
}