第7章 生成subset 子集

 

#include<algorithm>
using namespace std;
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const int MAXN = 100;
int ans[MAXN];
int maxnum;
void print_set(int num)
{
	printf("set: { ");
	for (int i = 0; i < num; ++i)
	{
		printf("%d ", ans[i]);
	}
	printf(" }\n");
}
void subset(int cur)
{
	// print the current set out
	print_set(cur);
	int start = cur == 0 ? 0 : ans[cur - 1] + 1;
	for (int i = start; i < maxnum; ++i)
	{
		ans[cur] = i;
		subset(cur + 1);
	}
}
int main()
{
	while (scanf("%d", &maxnum) == 1)
	{
		subset(0);
	}
}